{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:49:44Z","timestamp":1725634184049},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164517"},{"type":"electronic","value":"9783642711459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/978-3-642-71145-9_7","type":"book-chapter","created":{"date-parts":[[2011,11,15]],"date-time":"2011-11-15T13:40:16Z","timestamp":1321364416000},"page":"101-110","source":"Crossref","is-referenced-by-count":4,"title":["Completion of Globally Finite Term Rewriting Systems for Inductive Proofs"],"prefix":"10.1007","author":[{"given":"Richard","family":"G\u00f6bel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","first-page":"279","volume-title":"Orderings for Term-Rewriting Systems Theoretical Computer Science 1","author":"N Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for Term-Rewriting Systems Theoretical Computer Science 1? p. 279\u2013301 North-Holland Publishing Company (1982)"},{"key":"7_CR2","unstructured":"G\u00f6bel, R.: A Completion Procedure for Globally Finite Term Rewriting Systems Proceedings of an NSF Workshop on the Rewrite Rule Laboratory General Electric Schenectady (1983)"},{"issue":"2","key":"7_CR3","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":"Proofs by Induction in Equational Theories with Constructors Journal of the Association for Computing Machinery"},{"key":"7_CR4","volume-title":"Equations and Rewrite Rules: A Survey Technical Report CSL","author":"G Huet","year":"1980","unstructured":"Huet G., Oppen D.: Equations and Rewrite Rules: A Survey Technical Report CSL - 111 SRI International (1980)"},{"key":"7_CR5","first-page":"30","volume-title":"Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems 18th IEEE Symposium on foundations of Computer Science","author":"G Huet","year":"1977","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)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Jouannaud J. P., Kir chner H.: Completion of a Set of Rules Modulo a Set of Equations 11 th Symposium on Principles of Programming Languages Salt Lake City, Utah (1984)","DOI":"10.1145\/800017.800519"},{"key":"7_CR7","volume-title":"Complexity of Matching Problems First International Conference on Rewriting Techniques and Applications Dijon","author":"D Kapur","year":"1985","unstructured":"Kapur D., Narendran P., Benanav D.: Complexity of Matching Problems First International Conference on Rewriting Techniques and Applications Dijon (1985)"},{"key":"7_CR8","first-page":"263","volume-title":"Simple Word Problems in Universal Algebras Computational Problems in Abstract Algebra","author":"D Knuth","year":"1970","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)"},{"key":"7_CR9","unstructured":"Kounalis E.: Completeness in Data Type Specifications Proc. 3rd EUROCAL Linz (1985)"},{"key":"7_CR10","volume-title":"Decision Procedure for Simple Equational Theories with Commutative-Associative AxiomsComplete","author":"DS Lankford","year":"1977","unstructured":"Lankford D. S., Ballantyne A. M.: Decision Procedure for Simple Equational Theories with Commutative-Associative Axioms: Complete Sets of Permutative Reductions Report ATP \u2014 39 Departments of Mathematics and Computer Science University of Texas at Austin (1977)"},{"key":"7_CR11","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":"7_CR12","first-page":"233","volume":"28","author":"M Stickel","year":"1981","unstructured":"Stickel M., Peterson G.: Complete Sets of Reductions for Some Equational Theories Journal of the ACM, Vol 28, No. 2, p. 233\u2013264 (1981)","journal-title":"Complete Sets of Reductions for Some Equational Theories Journal of the ACM"}],"container-title":["Informatik-Fachberichte","GWAI-85"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-71145-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:56:07Z","timestamp":1606258567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-71145-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164517","9783642711459"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-71145-9_7","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1986]]}}}