{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:47:11Z","timestamp":1768283231451,"version":"3.49.0"},"reference-count":33,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":10090,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1016\/s0747-7171(85)80019-5","type":"journal-article","created":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T10:14:04Z","timestamp":1206785644000},"page":"329-349","source":"Crossref","is-referenced-by-count":68,"title":["Termination orderings for associative-commutative rewriting systems"],"prefix":"10.1016","volume":"1","author":[{"given":"Leo","family":"Bachmair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Plaisted","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(85)80019-5_bib1","author":"Bachmair","year":"1985","journal-title":"Commutation, transformation, and termination"},{"key":"10.1016\/S0747-7171(85)80019-5_bib2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0020-0190(79)90071-1","article-title":"A note on simplification orderings","volume":"9","author":"Dershowitz","year":"1979","journal-title":"Inf. Proc. Lett."},{"key":"10.1016\/S0747-7171(85)80019-5_bib3","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":"Theor. Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80019-5_bib4","article-title":"Termination","author":"N.","year":"1985","journal-title":"Proc. First Int. Conf. on Rewriting Techniques and Applications"},{"key":"10.1016\/S0747-7171(85)80019-5_bib5","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(85)80003-6","article-title":"Computing with rewrite systems","author":"Dershowitz","year":"1985","journal-title":"Inf. Control"},{"key":"10.1016\/S0747-7171(85)80019-5_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":"Commun ACM"},{"key":"10.1016\/S0747-7171(85)80019-5_bib7","first-page":"940","article-title":"Associative-commutative rewriting","author":"Dershowitz","year":"1983","journal-title":"Proc. 8th IJCAI"},{"key":"10.1016\/S0747-7171(85)80019-5_bib8","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/359657.359666","article-title":"Abstract data types and software validation","volume":"21","author":"Guttag","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/S0747-7171(85)80019-5_bib9","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\/S0747-7171(85)80019-5_bib10","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. Assoc. Comp. Mach."},{"key":"10.1016\/S0747-7171(85)80019-5_bib11","article-title":"On the uniform halting problem for term rewriting systems","volume":"283","author":"Huet","year":"1978","journal-title":"Rapport Laboria"},{"key":"10.1016\/S0747-7171(85)80019-5_bib12","series-title":"Formal Languages: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/S0747-7171(85)80019-5_bib13","article-title":"A catalogue of canonical term rewriting systems","author":"Hullot","year":"1980","journal-title":"Technical Report CSL-113"},{"key":"10.1016\/S0747-7171(85)80019-5_bib14","first-page":"83","article-title":"Completion of a set of rules modulo a set of equations","author":"Jouannaud","year":"1984","journal-title":"11th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/S0747-7171(85)80019-5_bib15","series-title":"IFIP Working Conf: on Formal Description of Programming Concepts II","article-title":"Recursive decomposition ordering","author":"Jouannaud","year":"1983"},{"key":"10.1016\/S0747-7171(85)80019-5_bib16","series-title":"Proc. 7th Int. Conf. on Automated Deduction","first-page":"175","article-title":"Termination of a set of rules modulo a set of equations","author":"Jouannaud","year":"1984"},{"key":"10.1016\/S0747-7171(85)80019-5_bib17","series-title":"Unpublished memo","article-title":"Two Generalizations of the Recursive Path Ordering","author":"Kamin","year":"1980"},{"key":"10.1016\/S0747-7171(85)80019-5_bib18","article-title":"A path ordering for proving termination of term rewriting systems","author":"Kapur","year":"1985","journal-title":"Proc. 10th Colloquium on Trees in Algebra and Programming"},{"key":"10.1016\/S0747-7171(85)80019-5_bib19","series-title":"Proc. NSF, Workshop on the Rewrite Rule Laboratory","first-page":"33","article-title":"Architecture of and experiments with RRL, a rewrite rule laboratory","author":"Kapur","year":"1983"},{"key":"10.1016\/S0747-7171(85)80019-5_bib20","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\/S0747-7171(85)80019-5_bib21","first-page":"210","article-title":"Well-quasi-ordering,the tree theorem and Vazsonyi's conjecture","volume":"95","author":"Kruskal","year":"1960","journal-title":"Trans. Amer.Math .Soc."},{"key":"10.1016\/S0747-7171(85)80019-5_bib22","series-title":"Memo MTP-3","article-title":"On Proving Term Rewriting Systems are Noetherian","author":"Lankford","year":"1979"},{"key":"10.1016\/S0747-7171(85)80019-5_bib23","series-title":"Decision Procedures for Simple Equational Theories with Associative Commutative Axioms: Complete Sets of Associative Commutative Reductions","author":"Lankford","year":"1977"},{"key":"10.1016\/S0747-7171(85)80019-5_bib24","first-page":"548","article-title":"Decomposition ordering as a tool to prove the termination of rewriting systems","author":"Lescanne","year":"1981","journal-title":"Proc.7th IJCAI"},{"key":"10.1016\/S0747-7171(85)80019-5_bib25","first-page":"331","article-title":"Some properties of decomposition ordering,a simplification ordering to prove termination of rewriting systems","volume":"16","author":"Lescanne","year":"1982","journal-title":"R.A.I.R.O. Informatique Theoretique\/Theoretical Informatics"},{"key":"10.1016\/S0747-7171(85)80019-5_bib26","article-title":"Computer experiments with the REVE term rewriting system","author":"Lescanne","year":"1983","journal-title":"Proc. 10th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/S0747-7171(85)80019-5_bib27","first-page":"789","article-title":"On the termination of Markov algorithms","author":"Manna","year":"1970","journal-title":"Proc. 3rd Hawaii Int. Conf. on System Science"},{"key":"10.1016\/S0747-7171(85)80019-5_bib28","article-title":"Probleme de Terminaison Finie des Systemes de Re\u00e9criture Equationnels","author":"Munoz","year":"1983","journal-title":"Thesis, Universit\u00e9 Nancy 1"},{"key":"10.1016\/S0747-7171(85)80019-5_bib29","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. Assoc. Comp. Mach."},{"key":"10.1016\/S0747-7171(85)80019-5_bib30","series-title":"Dept. of Computer Science Report","first-page":"78","article-title":"Well founded Orderings for Proving Termination of Systems of Rewrite Rules","author":"Plaisted","year":"1978"},{"key":"10.1016\/S0747-7171(85)80019-5_bib31","series-title":"Dept. of Computer Science Report","first-page":"78","article-title":"A Recursively Defined Ordering for Proving Termination for Term Rewriting Systems","author":"Plaisted","year":"1978"},{"key":"10.1016\/S0747-7171(85)80019-5_bib32","series-title":"Proc. NSF Workshop on the Rewrite Rule Laboratory","first-page":"123","article-title":"An associative path ordering","author":"Plaisted","year":"1983"},{"key":"10.1016\/S0747-7171(85)80019-5_bib33","series-title":"Proc. First Int.Conf. on Rewriting Techniques and Applications","article-title":"Plaisted ordering and recursive decomposition ordering revisited","author":"Rusinowitch","year":"1985"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800195?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800195?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T12:54:14Z","timestamp":1546174454000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717185800195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["S0747717185800195"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(85)80019-5","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}