{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:22Z","timestamp":1725663382145},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540172208"},{"type":"electronic","value":"9783540474210"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17220-3_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:14:42Z","timestamp":1330197282000},"page":"156-167","source":"Crossref","is-referenced-by-count":8,"title":["Ground confluence"],"prefix":"10.1007","author":[{"given":"Richard","family":"G\u00f6bel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"14_CR1","unstructured":"Dershowitz N.: Synthesis by Completion Proc. 9th IJCAI, Los Angeles 1985"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Fribourg L.: A Strong Restriction of the Inductive Completion Procedure Proc. ICALP 86, 1986","DOI":"10.1007\/3-540-16761-7_60"},{"key":"14_CR3","unstructured":"G\u00f6bel R.: A Specialized Knuth-Bendix Algorithm for Inductive Proofs Proc. Combinatorial Algorithms in Algebraic Structures, Universit\u00e4t Kaiserslautern 1985"},{"key":"14_CR4","unstructured":"G\u00f6bel R.: Ground Confluence SEKI-Report SR-86-18, Universit\u00e4t Kaiserslautern 1986"},{"issue":"2","key":"14_CR5","first-page":"239","volume":"25","author":"G. Huet","year":"1982","unstructured":"Huet G., Hullot J.: Proofs by Induction in Equational Theories with Constructors Journal of the Association for Computing Machinery 25(2), p. 239\u2013266, 1982","journal-title":"Journal of the Association for Computing Machinery"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Huet, G:, Oppen D.: Equations and Rewrite Rules: A Survey Technical Report CSL-111, SRI International 1980","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems 18th IEEE Symposium on foundations of Computer Science, p. 30\u201345, 1977","DOI":"10.1109\/SFCS.1977.9"},{"key":"14_CR8","unstructured":"Jouannaud J.-P., Kounalis E.: Proofs by Induction in Equational Theories without Constructors CRIN, University de Nancy, Nancy 1985"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Knuth D., Bendix P.: Simple Word Problems in Universal Algebras Computational Problems in Abstract Algebra, Ed. Leech I., Pergamon Press, p. 263\u2013297, 1970","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"14_CR10","unstructured":"Kapur D.,Narendran P., Otto F.: On ground confluence of term rewriting systems submitted for publication, 1987"},{"key":"14_CR11","unstructured":"Kapur D., Musser D. R.: Proofs by Consistency Proc. of an NSF Workshop on the Rewrite Rule Laboratory Sept. 83 General Electric R & D Center Report GEN84008, Schenectady 1984"},{"key":"14_CR12","unstructured":"Kounalis E.: Completeness in Data Type Specifications Proc. EUROCAL 85, Springer Lecture Notes, Linz 1985"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"K\u00fcnchlin W.: A Confluence Criterion Based on the Generalised Newman Lemma Proc. EUROCAL 85, Springer Lecture Notes, Linz 1985","DOI":"10.1007\/3-540-15984-3_294"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Musser D.: On Proving Inductive Properties of Abstract Data Types 7th Annual ACM Symposium on Principles of Programming Languages, Las Vegas 1980","DOI":"10.1145\/567446.567461"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Winkler F., Buchberger B.: A Crterion for Eliminating Unnecessary Reductions in the Knuth-Bendix Algorithm Colloqium on Algebra, Combinatorics and Logic in Computer Science, Gy\u00f6r (Hungary) 1983","DOI":"10.1145\/1089338.1089341"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17220-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:12:57Z","timestamp":1605643977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17220-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540172208","9783540474210"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-17220-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}