{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:35:43Z","timestamp":1777559743321,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0890-5401(90)90015-a","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"187-201","source":"Crossref","is-referenced-by-count":43,"title":["Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems"],"prefix":"10.1016","volume":"88","author":[{"given":"Max","family":"Dauchet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Heuillard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lescanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Tison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90015-A_BIB1","series-title":"Proceedings, 2nd IEEE Symp. on Logic In Computer Science","first-page":"353","article-title":"Decidability of the confluence of ground term rewriting systems","author":"Dauchet","year":"1987"},{"key":"10.1016\/0890-5401(90)90015-A_BIB2","series-title":"FCT' 85","first-page":"80","article-title":"Tree automata and decidability in ground terms rewriting systems","author":"Dauchet","year":"1985"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90015-A_BIB3","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","article-title":"Variations on the common subexpression problem","volume":"27","author":"Downey","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90015-A_BIB4","series-title":"Proceedings 9th Int. Conf. on Automated Deduction","first-page":"182","article-title":"Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time","author":"Gallier","year":"1988"},{"key":"10.1016\/0890-5401(90)90015-A_BIB5","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/0890-5401(90)90015-A_BIB6","author":"Huet","year":"1978"},{"key":"10.1016\/0890-5401(90)90015-A_BIB7","series-title":"Formal Languages Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: A survey","author":"Huet","year":"1980"},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90015-A_BIB8","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/322186.322198","article-title":"Fast decision procedures based on congruence closure","volume":"27","author":"Nelson","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90015-A_BIB9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(87)90100-9","article-title":"The Church-Rosser property for ground term rewriting systems is decidable","volume":"49","author":"Oyamaguchi","year":"1987","journal-title":"Theoret. Comput. Sc."},{"key":"10.1016\/0890-5401(90)90015-A_BIB10","author":"Oyamaguchi","year":"1987"},{"key":"10.1016\/0890-5401(90)90015-A_BIB11","series-title":"Proceedings, 3rd Conf. on Rewriting Techniques and Applications","article-title":"Efficient completion: A O(n\u00b7log(n)) algorithm for generating reduced sets of ground rewrite rules equivalent to a set of ground equations E","author":"Snyder","year":"1989"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090015A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090015A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:52Z","timestamp":1548897952000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090015A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["089054019090015A"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90015-a","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}