{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:12:13Z","timestamp":1762175533512},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"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":[[2003,6]]},"DOI":"10.1016\/s0890-5401(03)00022-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T13:32:55Z","timestamp":1053351175000},"page":"187-211","source":"Crossref","is-referenced-by-count":3,"title":["The unification problem for confluent right-ground term rewriting systems"],"prefix":"10.1016","volume":"183","author":[{"given":"Michio","family":"Oyamaguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshikatsu","family":"Ohta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0890-5401(03)00022-1_BIB1","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1006\/inco.1994.1043","article-title":"Syntacticness cycle-syntacticness and shallow theories","volume":"111","author":"Comon","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S0890-5401(03)00022-1_BIB2","doi-asserted-by":"crossref","unstructured":"M. Dauchet, S. Tison, The theory of ground rewriting systems is decidable, in: Proceedings of the 5th IEEE Symposium on Logic in Computer Science, 1990, pp. 242\u2013248","DOI":"10.1109\/LICS.1990.113750"},{"key":"10.1016\/S0890-5401(03)00022-1_BIB3","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0890-5401(03)00022-1_BIB4","doi-asserted-by":"crossref","unstructured":"J.-M. Hullot, Canonical forms and unification, in: Proceedings of the 5th Conference on Automated Deduction, LNCS, vol. 87, 1980, pp. 318\u2013334","DOI":"10.21236\/ADA087640"},{"key":"10.1016\/S0890-5401(03)00022-1_BIB5","doi-asserted-by":"crossref","unstructured":"F. Jacquemard, C. Meyer, C. Weidenbach, Unification in extensions of shallow equational theories, in: Proceedings of the 9th Rewriting Techniques and Applications, LNCS, vol. 1379, 1998, pp. 76\u201390","DOI":"10.1007\/BFb0052362"},{"issue":"6","key":"10.1016\/S0890-5401(03)00022-1_BIB6","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1006\/jsco.1997.0197","article-title":"A deterministic lazy narrowing calculus","volume":"25","author":"Middeldorp","year":"1998","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0890-5401(03)00022-1_BIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(96)00071-0","article-title":"Lazy narrowing: strong completeness and eager variable elimination","volume":"167","author":"Middeldorp","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(03)00022-1_BIB8","doi-asserted-by":"crossref","unstructured":"R. Nieuwenhuis, Basic paramodulation and decidable theories, in: Proceedings of the 11th IEEE Symposium on Logic in Computer Science, 1996, pp. 473\u2013482","DOI":"10.1109\/LICS.1996.561464"},{"issue":"3","key":"10.1016\/S0890-5401(03)00022-1_BIB9","first-page":"347","article-title":"The reachability and joinability problems for right-ground term-rewriting systems","volume":"13","author":"Oyamaguchi","year":"1990","journal-title":"Journal of Information Processing"},{"issue":"5","key":"10.1016\/S0890-5401(03)00022-1_BIB10","first-page":"718","article-title":"On the word problem for right-ground term-rewriting systems","volume":"E73","author":"Oyamaguchi","year":"1990","journal-title":"Transactions of IEICE"},{"key":"10.1016\/S0890-5401(03)00022-1_BIB11","first-page":"202","article-title":"Efficient unification with infinite terms in logic programming","author":"Martelli","year":"1984","journal-title":"Proceedings of Fifth Generation Computer Systems"},{"issue":"4","key":"10.1016\/S0890-5401(03)00022-1_BIB12","first-page":"439","article-title":"Conditional linearization of non-duplicating term rewriting systems","volume":"E84-D","author":"Toyama","year":"2001","journal-title":"Transactions of IEICE"},{"issue":"11","key":"10.1016\/S0890-5401(03)00022-1_BIB13","first-page":"847","article-title":"On the E-overlapping property of nonlinear term rewriting systems","volume":"J80-D-I","author":"Matsuura","year":"1997","journal-title":"Transactions of IEICE"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T01:23:37Z","timestamp":1553390617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103000221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0890540103000221"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00022-1","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}