{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:49Z","timestamp":1747546909498},"reference-count":62,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00187-n","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"199-242","source":"Crossref","is-referenced-by-count":26,"title":["Towards a foundation of completion procedures as semidecision procedures"],"prefix":"10.1016","volume":"146","author":[{"given":"Maria Paola","family":"Bonacina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieh","family":"Hsiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00187-N_bib1","series-title":"Proc. Symp. on the Design and Implementation of Systems for Symbolic Computation","first-page":"184","article-title":"Heuristical criteria in refutational theorem proving","volume":"Vol. 429","author":"Anantharaman","year":"1990"},{"key":"10.1016\/0304-3975(94)00187-N_bib2","series-title":"Proc. 2nd Internat. Workshop on Conditional and Typed Term Rewriting Systems","first-page":"156","article-title":"An application of the theorem prover SBR3 to many-valued logic","volume":"Vol. 516","author":"Anantharaman","year":"1991"},{"key":"10.1016\/0304-3975(94)00187-N_bib3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF00302643","article-title":"Automated proofs of the Moufang identities in alternative rings","volume":"6","author":"Anantharaman","year":"1990","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0304-3975(94)00187-N_bib4","series-title":"Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications","first-page":"533","article-title":"SBReve2: a term rewriting laboratory with (AC)-unfailing completion","volume":"Vol. 355","author":"Anantharaman","year":"1989"},{"key":"10.1016\/0304-3975(94)00187-N_bib5","author":"Anantharaman","year":"1989"},{"key":"10.1016\/0304-3975(94)00187-N_bib6","article-title":"Proofs methods for equational theories","author":"Bachmair","year":"1987"},{"key":"10.1016\/0304-3975(94)00187-N_bib7","series-title":"Proc. 3rd Ann. IEEE Symp. on Logic in Computer Science","first-page":"228","article-title":"Proof by consistency in equational theories","author":"Bachmair","year":"1988"},{"key":"10.1016\/0304-3975(94)00187-N_bib8","series-title":"Proc. 2nd Ann. IEEE Symp. on Logic in Computer Science","article-title":"Inference rules for rewrite-based first-order theorem proving","author":"Bachmair","year":"1987"},{"key":"10.1016\/0304-3975(94)00187-N_bib9","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(94)00187-N_bib10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(89)90003-0","article-title":"Completion for rewriting modulo a congruence","volume":"67","author":"Bachmair","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00187-N_bib11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/174652.174655","article-title":"Equational inference, canonical proofs and proof orderings","volume":"41","author":"Bachmair","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00187-N_bib12","series-title":"Proc. 1st IEEE Symp. on Logic in Computer Science","first-page":"346","article-title":"Orderings for equational proofs","author":"Bachmair","year":"1986"},{"key":"10.1016\/0304-3975(94)00187-N_bib13","series-title":"Resolution of Equations in Algebraic Structures, Vol. II: Rewriting Techniques","first-page":"1","article-title":"Completion without failure","author":"Bachmair","year":"1989"},{"key":"10.1016\/0304-3975(94)00187-N_bib14","series-title":"Proc. 10th Internat. Conf. on Automated Deduction","first-page":"427","article-title":"On restrictions of ordered paramodulation with simplification","volume":"Vol. 449","author":"Bachmair","year":"1990"},{"key":"10.1016\/0304-3975(94)00187-N_bib15","series-title":"Proc. 2nd Internat. Workshop on Conditional and Typed Term Rewriting Systems","first-page":"162","article-title":"Completion of first-order clauses with equality by strict superposition","volume":"Vol. 516","author":"Bachmair","year":"1991"},{"key":"10.1016\/0304-3975(94)00187-N_bib16","article-title":"Sulla dimostrazione di teoremi per completamento","author":"Bonacina","year":"1991"},{"key":"10.1016\/0304-3975(94)00187-N_bib17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0743-1066(92)90050-D","article-title":"On rewrite programs: semantics and relationship with Prolog","volume":"14","author":"Bonacina","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)00187-N_bib18","series-title":"Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications","first-page":"548","article-title":"KBlab: An equational theorem prover for the Macintosh","volume":"Vol. 355","author":"Bonacina","year":"1989"},{"key":"10.1016\/0304-3975(94)00187-N_bib19","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0304-3975(94)00187-N_bib20","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewriting systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00187-N_bib21","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","article-title":"Computing with rewrite systems","volume":"65","author":"Dershowitz","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)00187-N_bib22","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00187-N_bib23","series-title":"Resolution of Equations in Algebraic Structures, Vol. II: Rewriting Techniques","first-page":"31","article-title":"Completion and its applications","author":"Dershowitz","year":"1989"},{"key":"10.1016\/0304-3975(94)00187-N_bib24","series-title":"Proc. 2nd Internat. Workshop on Conditional and Typed Rewriting Systems","first-page":"14","article-title":"A maximal-literal unit strategy for Horn clauses","volume":"Vol. 516","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(94)00187-N_bib25","series-title":"Proc. 18rd Internat. Conf. on Automat, Languages and Programming","article-title":"Canonical sets of Horn clauses","author":"Dershowitz","year":"1991"},{"key":"10.1016\/0304-3975(94)00187-N_bib26","series-title":"Proc. 2nd Internat. Conf. on Logic Programming","first-page":"313","article-title":"Logic programming by completion","author":"Dershowitz","year":"1984"},{"key":"10.1016\/0304-3975(94)00187-N_bib27","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1989"},{"key":"10.1016\/0304-3975(94)00187-N_bib28","article-title":"Notations for rewriting","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(94)00187-N_bib29","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multisets orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00187-N_bib30","series-title":"Machine Intelligence 11: The Logic and Acquisition of Knowledge","first-page":"21","article-title":"Equational programming","author":"Dershowitz","year":"1988"},{"key":"10.1016\/0304-3975(94)00187-N_bib31","series-title":"Proc. 7rd Internat. Conf. on Automated Deduction","article-title":"Associative-commutative unification","volume":"Vol. 170","author":"Fages","year":"1984"},{"key":"10.1016\/0304-3975(94)00187-N_bib32","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0747-7171(89)80069-0","article-title":"A strong restriction to the inductive completion procedure","volume":"8","author":"Fribourg","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00187-N_bib33","series-title":"Proc. 5th Internat. Conf. on Automated Deduction","first-page":"356","article-title":"How to prove algebraic inductive hypotheses without induction","volume":"Vol. 87","author":"Goguen","year":"1980"},{"key":"10.1016\/0304-3975(94)00187-N_bib34","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":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)00187-N_bib35","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0747-7171(87)80024-X","article-title":"Rewrite method for theorem proving in first order theories with equality","volume":"3","author":"Hsiang","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00187-N_bib36","series-title":"Proc. 10th Internat. Conf. on Automata, Languages and Programming","article-title":"Rewrite methods for classical and nonclausal theorem proving","volume":"Vol. 154","author":"Hsiang","year":"1983"},{"key":"10.1016\/0304-3975(94)00187-N_bib37","series-title":"Proc. 8th Conf. on Automated Deduction","first-page":"141","article-title":"A new method for establishing refutational completeness in theorem proving","volume":"Vol. 230","author":"Hsiang","year":"1986"},{"key":"10.1016\/0304-3975(94)00187-N_bib38","series-title":"Proc. 14th Internat. Conf. on Automata, Languages and Programming","first-page":"54","article-title":"On word problems in equational theories","volume":"Vol. 267","author":"Hsiang","year":"1987"},{"key":"10.1016\/0304-3975(94)00187-N_bib39","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1145\/116825.116833","article-title":"Proving refutational completeness of theorem proving strategies: the transfinite semantic tree method","volume":"38","author":"Hsiang","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00187-N_bib40","series-title":"Proc. 10th Internat. Joint Conf. on Artificial Intelligence","first-page":"990","article-title":"Complete inference rules for the cancellation laws","author":"Hsiang","year":"1987"},{"key":"10.1016\/0304-3975(94)00187-N_bib41","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(94)00187-N_bib42","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","article-title":"A complete proof of correctness of the Knuth-Bendix completion algorithm","volume":"23","author":"Huet","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00187-N_bib43","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","article-title":"Proofs by induction in equational theories with constructors","volume":"25","author":"Huet","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00187-N_bib44","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(94)00187-N_bib45","author":"Jouannaud","year":"1989"},{"key":"10.1016\/0304-3975(94)00187-N_bib46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(89)90062-X","article-title":"Automatic proofs by induction in equational theories without constructors","volume":"82","author":"Jouannaud","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)00187-N_bib47","series-title":"Two generalizations of the recursive path ordering","author":"Kamin","year":"1980"},{"key":"10.1016\/0304-3975(94)00187-N_bib48","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0004-3702(87)90017-8","article-title":"Proof by consistency","volume":"31","author":"Kapur","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)00187-N_bib49","series-title":"Proc. 9th Internat. Joint Conf. on Artificial Intelligence","first-page":"1146","article-title":"An equational approach to theorem proving in first order predicate calculus","author":"Kapur","year":"1985"},{"key":"10.1016\/0304-3975(94)00187-N_bib50","series-title":"Proc. 8rd Internat. Conf. on Automated Deduction","article-title":"Proof by induction using test sets","volume":"Vol. 230","author":"Kapur","year":"1986"},{"key":"10.1016\/0304-3975(94)00187-N_bib51","series-title":"Proc. Conf. on Computational Problems in Abstract Algebras","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(94)00187-N_bib52","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0747-7171(08)80134-4","article-title":"On word problems in Horn theories","volume":"11","author":"Kounalis","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00187-N_bib53","series-title":"Automatic Theorem Proving Project","article-title":"Canonical inference, Memo ATP-32","author":"Lankford","year":"1975"},{"key":"10.1016\/0304-3975(94)00187-N_bib54","article-title":"A simple explanation of inductionless induction","author":"Lankford","year":"1981"},{"key":"10.1016\/0304-3975(94)00187-N_bib55","series-title":"Proc. 7th ACM Symp. on Principles of Programming Languages","first-page":"154","article-title":"On proving inductive properties of abstract data types","author":"Musser","year":"1980"},{"key":"10.1016\/0304-3975(94)00187-N_bib56","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0212006","article-title":"A technique for establishing completeness results in theorem proving with equality","volume":"12","author":"Peterson","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00187-N_bib57","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(94)00187-N_bib58","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","article-title":"Semantic confluence tests and completion methods","volume":"65","author":"Plaisted","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)00187-N_bib59","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0747-7171(08)80131-9","article-title":"Theorem-proving with resolution and superposition","volume":"11","author":"Rusinowitch","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00187-N_bib60","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00247827","article-title":"How to avoid the derivation of redundant clauses in reasoning systems","volume":"9","author":"Socher-Ambrosius","year":"1992","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0304-3975(94)00187-N_bib61","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A unification algorithm for associative-commutative functions","volume":"28","author":"Stickel","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00187-N_bib62","series-title":"Proc. 9th Internat. Conf. on Automated Deduction","first-page":"1","article-title":"First order theorem proving using conditional rewrite rules","volume":"Vol. 310","author":"Zhang","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400187N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400187N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:55:05Z","timestamp":1555376105000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400187N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":62,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400187N"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00187-n","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}