{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:44:44Z","timestamp":1768272284904,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90003-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"173-201","source":"Crossref","is-referenced-by-count":54,"title":["Completion for rewriting modulo a congruence"],"prefix":"10.1016","volume":"67","author":[{"given":"Leo","family":"Bachmair","sequence":"first","affiliation":[]},{"given":"Nachum","family":"Dershowitz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90003-0_BIB1","series-title":"Ph.D. Dissertation","article-title":"Proof methods for equational theories","author":"Bachmair","year":"1987"},{"key":"10.1016\/0304-3975(89)90003-0_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0747-7171(88)80018-X","article-title":"Critical pair criteria for completion","volume":"6","author":"Bachmair","year":"1988","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(89)90003-0_BIB3","first-page":"346","article-title":"Orderings for equational proofs","author":"Bachmair","year":"1986","journal-title":"Proc. Symp. Logic in Computer Science"},{"key":"10.1016\/0304-3975(89)90003-0_BIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(85)80019-5","article-title":"Termination orderings for associative-commutative rewriting systems","volume":"1","author":"Bachmair","year":"1985","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(89)90003-0_BIB5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","article-title":"Termination of rewriting systems by polynomial interpretations and its implementation","volume":"9","author":"Ben Cherifa","year":"1987","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/0304-3975(89)90003-0_BIB6","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90003-0_BIB7","series-title":"Proc. 7th Conf. on Automated Deduction","first-page":"194","article-title":"Associative-commutative unfication","volume":"170","author":"Fages","year":"1984"},{"key":"10.1016\/0304-3975(89)90003-0_BIB8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(86)90175-1","article-title":"Complete sets of unifiers and matchers in equational theories","volume":"43","author":"Fages","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90003-0_BIB9","series-title":"Proc. 2nd Rewrite Techniques and Applications","first-page":"216","article-title":"A general complete E-unification procedure","volume":"256","author":"Gallier","year":"1987"},{"key":"10.1016\/0304-3975(89)90003-0_BIB10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(85)90074-8","article-title":"Refutational theorem proving using term-rewriting systems","volume":"25","author":"Hsiang","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0304-3975(89)90003-0_BIB11","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90003-0_BIB12","series-title":"Tech. Rept. CSL-113","article-title":"A catalogue of canonical term rewriting systems","author":"Hullot","year":"1980"},{"key":"10.1016\/0304-3975(89)90003-0_BIB13","series-title":"Proc. 8th Coll. on Trees in Algebra and Programming, CAAP '83","first-page":"269","article-title":"Confluent and coherent equational term rewriting systems: application to proofs in abstract data types","volume":"59","author":"Jouannaud","year":"1983"},{"key":"10.1016\/0304-3975(89)90003-0_BIB14","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0215084","article-title":"Completion of a set of rules modulo a set of equations","volume":"15","author":"Jouannaud","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90003-0_BIB15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0747-7171(88)80019-1","article-title":"Only prime superpositions need be considered in the Knuth-Bendix completion procedure","volume":"6","author":"Kapur","year":"1988","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(89)90003-0_BIB16","first-page":"206","article-title":"Computing unification algorithms","author":"Kirchner","year":"1986","journal-title":"Proc. Symp. Logic in Computer Science"},{"key":"10.1016\/0304-3975(89)90003-0_BIB17","series-title":"Resolution of Equations in Algebraic Structures","article-title":"Methods and tools for equational unification","author":"Kirchner","year":"1989"},{"key":"10.1016\/0304-3975(89)90003-0_BIB18","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(89)90003-0_BIB19","series-title":"Tech. Rept. 86-02","article-title":"Equational completion by proof simplification","author":"K\u00fcchlin","year":"1986"},{"key":"10.1016\/0304-3975(89)90003-0_BIB20","series-title":"Tech. Rept. ATP-32","article-title":"Canonical inference","author":"Lankford","year":"1975"},{"key":"10.1016\/0304-3975(89)90003-0_BIB21","series-title":"Tech. Rept. ATP-37","article-title":"Decision procedures for simple equational theories with permutative axioms: canonical sets o permutative reductions","author":"Lankford","year":"1977"},{"key":"10.1016\/0304-3975(89)90003-0_BIB22","series-title":"Tech. Rept. ATP-39","article-title":"Decision procedures for simple equational theories with associative-commutative axioms: complete sets of associative-commutative reductions","author":"Lankford","year":"1977"},{"key":"10.1016\/0304-3975(89)90003-0_BIB23","series-title":"Tech. Rept. ATP-35","article-title":"Decision procedures for simple equational theories with commutative axioms: Complete sets o commutative reductions","author":"Lankford","year":"1977"},{"key":"10.1016\/0304-3975(89)90003-0_BIB24","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","article-title":"Complete sets of reductions for some equational theories","volume":"28","author":"Peterson","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90003-0_BIB25","first-page":"73","article-title":"Building-in equational theories","volume":"7","author":"Plotkin","year":"1972"},{"key":"10.1016\/0304-3975(89)90003-0_BIB26","series-title":"Proc. 7th Internat. Conf. on Automated Deduction","first-page":"1","article-title":"Universal unification","volume":"170","author":"Siekman","year":"1984"},{"key":"10.1016\/0304-3975(89)90003-0_BIB27","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","article-title":"Automated theorem proving for theories with simplifiers, commutativity, and associativity","volume":"21","author":"Slagle","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90003-0_BIB28","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A complete unification algorithm for associative-commutative functions","volume":"28","author":"Stickel","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90003-0_BIB29","series-title":"Ph.D. Dissertation","article-title":"The Church-Rosser property in computer algebra and special theorem proving: an investigation of critical-pair\/completion algorithms","author":"Winkler","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:33Z","timestamp":1555113393000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":29,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589900030"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90003-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}