{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:21:30Z","timestamp":1794338490221,"version":"4.9.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"value":"354017219X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039613","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T11:55:52Z","timestamp":1138708552000},"page":"286-298","source":"Crossref","is-referenced-by-count":21,"title":["Ground term confluence in parametric conditional equational specifications"],"prefix":"10.1007","author":[{"given":"Harald","family":"Ganzinger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Aerospace Report","volume-title":"Applications of the Knuth-Bendix completion procedure","author":"N. Dershowitz","year":"1983","unstructured":"Dershowitz, N.: Applications of the Knuth-Bendix completion procedure. Aerospace Report ATR-83(8478)-2, The Aerospace Corp., El Segundo, Calif., USA, 1983."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Drosten, K.: Towards executable specifications using conditional axioms. Report 83-01, T.U. Braunschweig, 1983.","DOI":"10.1007\/3-540-12920-0_8"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Kreowski, H.-J., Thatcher, J.W., Wagner, E.G., and Wright, J.B.: Parameter passing in algebraic specification languages. LNCS 134, Springer 1981.","DOI":"10.1007\/3-540-11490-4_21"},{"key":"23_CR4","first-page":"188","volume":"154","author":"H. Ehrig","year":"1983","unstructured":"Ehrig, H., Wagner, E.G., Thatcher, J.W.: Algebraic specifications with generating constraints. Proc. ICALP 83, LNCS 154, 1983, 188\u2013202.","journal-title":"LNCS"},{"key":"23_CR5","unstructured":"Fay, M.: First-order unification in equational theories. 4th Workshop on Automated Deduction, Austin, 1979, 161\u2013167."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Fribourg, L.: A strong restriction of the inductive completion procedure. Proc. ICALP 86, LNCS, 105\u2013115.","DOI":"10.1007\/3-540-16761-7_60"},{"key":"23_CR7","unstructured":"Hsiang, J. and Dershowitz, N.: A term rewriting theorem prover. Proc. 10th ICALP, 1983, 331\u2013346."},{"key":"23_CR8","first-page":"11","volume":"23","author":"G. Huet","year":"1981","unstructured":"Huet, G.: A complete proof of the correctness of the Knuth-Bendix completion algorithm. JCSS 23 (1981), 11\u201321.","journal-title":"JCSS"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Hullot, J.M.: Canonical forms and unification. 5th Workshop on Automated Deduction, Les Arcs, 1980, 318\u2013334.","DOI":"10.21236\/ADA087640"},{"key":"23_CR10","unstructured":"Jouannaud, J.P., and Waldmann, B.: Reductive conditional term rewriting systems. Proc. 3rd TC2 Working Conference on the Formal Description of Prog. Concepts, Ebberup, Denmark, Aug. 1986, North-Holland, to appear."},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"Kaplan, St.: Conditional rewrite rules. TCS 33 (1984), 175\u2013193.","journal-title":"TCS"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Kaplan, St.: Fair conditional term rewrite systems: unification, termination and confluence. Report 194, U. de Paris-Sud, Centre d'Orsay, Nov. 1984.","DOI":"10.1007\/978-3-662-09691-8_11"},{"key":"23_CR13","first-page":"173","volume":"186","author":"D. Kapur","year":"1985","unstructured":"Kapur, D., Narendran, P., and Sivakumar, G.: A path ordering for proving termination of term rewrite systems. LNCS 186, 1985, 173\u2013187.","journal-title":"LNCS"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Lescanne, P.: Computer experiments with the REVE term rewriting system generator. Proc. 10th ACM Symp. on POPL, Austin, Texas, 1983.","DOI":"10.1145\/567067.567078"},{"key":"23_CR15","unstructured":"Pletat, U., Engels, G., and Ehrich, H.-D.: Operational semantics of algebraic specifications with conditional equations. Proc. 7th CAAP, LNCS, 1982."},{"key":"23_CR16","first-page":"141","volume":"202","author":"P. Rety","year":"1985","unstructured":"Rety, P., Kirchner, C., Kirchner, H., and Lesanne, P.: NARROWER, a new algorithm for unification and its application to logic programming. Conf. on Rewriting Techniques and Applications, Dijon 1985, LNCS 202, 141\u2013157.","journal-title":"LNCS"},{"key":"23_CR17","unstructured":"Remy, J.L. and Zhang, H.: REVEUR 4: A system for validating conditional algebraic specifications of abstract data types. Proc. 6th ECAI, Pisa 1984, 563\u2013572."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, H. and Remy, J.L.: Contextual rewriting. Conf. on Rewriting Techniques and Applications, Dijon 1985, LNCS 202","DOI":"10.1007\/3-540-15976-2_2"}],"container-title":["Lecture Notes in Computer Science","STACS 87"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039613.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T10:29:07Z","timestamp":1736245747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354017219X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0039613","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0039590","asserted-by":"object"}]},"subject":[]}}