{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:13:20Z","timestamp":1648865600066},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"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":9663,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1987,2]]},"DOI":"10.1016\/0167-6423(87)90004-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:19:32Z","timestamp":1027657172000},"page":"69-86","source":"Crossref","is-referenced-by-count":6,"title":["Reveur-3: the implementation of a general completion procedure parameterized by built-in theories and strategies"],"prefix":"10.1016","volume":"8","author":[{"given":"Claude","family":"Kirchner","sequence":"first","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(87)90004-9_BIB1","series-title":"Proc. 1st Conference on Rewriting Techniques and Applications","article-title":"Associative path orderings","volume":"202","author":"Bachmair","year":"1985"},{"key":"10.1016\/0167-6423(87)90004-9_BIB2","series-title":"Th\u00e8se de doctorat d'Etat","article-title":"Utilisation des syst\u00e8mes de r\u00e9\u00e9criture d'expressions fonctionnelles comme outils de transformation de programmes it\u00e9ratifs","author":"Bellegarde","year":"1985"},{"key":"10.1016\/0167-6423(87)90004-9_BIB3","series-title":"Proc. 1st Conference on Rewriting Techniques and Applications","article-title":"History and basic features of the critical-pair\u29f8completion approach","volume":"202","author":"Buchberger","year":"1985"},{"key":"10.1016\/0167-6423(87)90004-9_BIB4","series-title":"Proc. 10th International Joint Conference on Artificial Intelligence","article-title":"Associate-commutative rewriting","author":"Dershowitz","year":"1983"},{"key":"10.1016\/0167-6423(87)90004-9_BIB5","series-title":"Proc. EUROCAL Conference","article-title":"ERIL equational reasoning: an interactive laboratory","author":"Dick","year":"1985"},{"key":"10.1016\/0167-6423(87)90004-9_BIB6","series-title":"Technical Report","article-title":"Le syst\u00e8me KB: manuel de r\u00e9f\u00e9rence: pr\u00e9sentation et bibliographie, mise en oeuvre","author":"Fages","year":"1984"},{"key":"10.1016\/0167-6423(87)90004-9_BIB7","series-title":"Technical Report","article-title":"REVE: A term rewriting system generator with failure-resistant Knuth\u2013Bendix","author":"Forgaard","year":"1984"},{"key":"10.1016\/0167-6423(87)90004-9_BIB8","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985","journal-title":"Proc. 12th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(87)90004-9_BIB9","series-title":"Preuves de terminaison des syst\u00e8mes de r\u00e9\u00e9criture associatifs commutatifs: une m\u00e9thode fond\u00e9e sur la r\u00e9\u00e9criture elle-m\u00eame","author":"Gnaedig","year":"1986"},{"key":"10.1016\/0167-6423(87)90004-9_BIB10","series-title":"Technical Report","article-title":"Larch in five easy pieces","author":"Guttag","year":"1985"},{"issue":"4","key":"10.1016\/0167-6423(87)90004-9_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\/0167-6423(87)90004-9_BIB12","series-title":"Formal Language Theory: Perspectives and Open Problems","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0167-6423(87)90004-9_BIB13","series-title":"Technical Report","article-title":"A catalog of canonical term rewriting systems","author":"Hullot","year":"1980"},{"key":"10.1016\/0167-6423(87)90004-9_BIB14","series-title":"Proc. 5th Conference on Automated Deduction","article-title":"Deciding unique termination of permutative rewrite systems: choose your term algebra carefully","volume":"87","author":"Jeanrond","year":"1980"},{"key":"10.1016\/0167-6423(87)90004-9_BIB15","series-title":"Proc. 4th Conference on Automata, Algebra and Programming","article-title":"Church \u2013 Rosser computations with equational term rewriting systems","volume":"159","author":"Jouannaud","year":"1993"},{"key":"10.1016\/0167-6423(87)90004-9_BIB16","doi-asserted-by":"crossref","unstructured":"J.P. Jouannaud and H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM J. Comput. 15(4)","DOI":"10.1145\/800017.800519"},{"key":"10.1016\/0167-6423(87)90004-9_BIB17","series-title":"Proc. 7th Conference on Automated Deduction","article-title":"Termination of a set of rules modulo a set of equations","author":"Jouannaud","year":"1984"},{"key":"10.1016\/0167-6423(87)90004-9_BIB18","first-page":"33","article-title":"Experiments with and architecture of RRL, a rewrite rule laboratory","author":"Kapur","year":"1983","journal-title":"Proc. NSF Workshop on the Rewrite Rule Laboratory"},{"key":"10.1016\/0167-6423(87)90004-9_BIB19","series-title":"M\u00e9thodes et outils de conception syst\u00e9matique d'algorithmes d'unification dans les th\u00e9ories \u00e9quationnelles","author":"Kirchner","year":"1985"},{"key":"10.1016\/0167-6423(87)90004-9_BIB20","series-title":"Proc. 7th Conference on Automated Deduction","article-title":"A new equational unification method: a generalization of Martelli\u2013Montanari algorithm","author":"Kirchner","year":"1984"},{"key":"10.1016\/0167-6423(87)90004-9_BIB21","series-title":"Proc. 7th Conference on Automated Deduction","article-title":"A general inductive completion algorithm and application to abstract data types","author":"Kirchner","year":"1984"},{"key":"10.1016\/0167-6423(87)90004-9_BIB22","series-title":"Preuves par compl\u00e9tion dans les vari\u00e9t\u00e9s d'alg\u00e8bres","author":"Kirchner","year":"1985"},{"key":"10.1016\/0167-6423(87)90004-9_BIB23","series-title":"Computational Problems in Abstract Algebra","article-title":"Simple word problems in universal algebra","author":"Knuth","year":"1970"},{"key":"10.1016\/0167-6423(87)90004-9_BIB24","series-title":"Proc. EUROCAL Conference","article-title":"A confluence criterion based on the generalized Newman lemma","author":"Kuchlin","year":"1985"},{"key":"10.1016\/0167-6423(87)90004-9_BIB25","series-title":"Technical Report","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\/0167-6423(87)90004-9_BIB26","series-title":"Technical Report","article-title":"Decision procedures for simple equational theories with commutative axioms: Complete sets of commutative reductions","author":"Lankford","year":"1977"},{"key":"10.1016\/0167-6423(87)90004-9_BIB27","series-title":"Technical Report","article-title":"Decision procedures for simple equational theories with permutative axioms: Complete sets of permutative reductions","author":"Lankford","year":"1977"},{"key":"10.1016\/0167-6423(87)90004-9_BIB28","article-title":"CLU Reference Manual","volume":"114","author":"Liskov","year":"1981"},{"key":"10.1016\/0167-6423(87)90004-9_BIB29","first-page":"243","article-title":"Filtrage associatif, commutatif ou idempotent","author":"Mzali","year":"1985","journal-title":"Mat\u00e9riels et logiciels pour la 5ieme g\u00e9n\u00e9ration"},{"key":"10.1016\/0167-6423(87)90004-9_BIB30","article-title":"Computer experiments with the REVE term rewriting systems generator","author":"Lescanne","year":"1983","journal-title":"Proc. 10th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(87)90004-9_BIB31","series-title":"PhD thesis","article-title":"Confluence methods and the word problem in universal algebra","author":"Pedersen","year":"1984"},{"key":"10.1016\/0167-6423(87)90004-9_BIB32","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\/0167-6423(87)90004-9_BIB33","article-title":"NARROWER: a new algorithm for unification and its application to logic programming","volume":"202","author":"Rety","year":"1985"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900049?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900049?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:56Z","timestamp":1555072136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["0167642387900049"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90004-9","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}