{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:28:10Z","timestamp":1768285690416,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"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,5]]},"DOI":"10.1016\/0890-5401(90)90023-b","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"14-31","source":"Crossref","is-referenced-by-count":31,"title":["On ground-confluence of term rewriting systems"],"prefix":"10.1016","volume":"86","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90023-B_BIB1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF00271645","article-title":"Finite complete rewriting systems and the complexity of the word problem","volume":"21","author":"Bauer","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(90)90023-B_BIB2","series-title":"Proceedings, ICALP","article-title":"A strong restriction of the inductive completion procedure","author":"Fribourg","year":"1986"},{"key":"10.1016\/0890-5401(90)90023-B_BIB3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","article-title":"Confluent and other types of Thue systems","volume":"29","author":"Book","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90023-B_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(85)90089-1","article-title":"Reductions in tree replacement systems","volume":"37","author":"Gallier","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90023-B_BIB5","series-title":"Proceedings of a Workshop on Combinatorial Algorithms in Algebraic Structures","article-title":"A specialized Knuth-Bendix algorithm for inductive proofs","author":"Goebel","year":"1985"},{"key":"10.1016\/0890-5401(90)90023-B_BIB6","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(90)90023-B_BIB7","author":"Huet","year":"1978"},{"key":"10.1016\/0890-5401(90)90023-B_BIB8","series-title":"5th Conf. on Automated Deduction","first-page":"318","article-title":"Canonical forms and unification","volume":"Vol. 87","author":"Hullot","year":"1980"},{"key":"10.1016\/0890-5401(90)90023-B_BIB9","series-title":"IEEE Symp. on Logic in Comput. Science","first-page":"358","article-title":"Proofs by induction in equational theories without constructors","author":"Jouannaud","year":"1986"},{"key":"10.1016\/0890-5401(90)90023-B_BIB10","author":"Kapur","year":"1984","journal-title":"Proof by Consistency"},{"key":"10.1016\/0890-5401(90)90023-B_BIB22","unstructured":"Artif. Intell. J., in press."},{"key":"10.1016\/0890-5401(90)90023-B_BIB11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","article-title":"A finite Thue system with decidable word problem and without equvalent finite canonical system","volume":"35","author":"Kapur","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90023-B_BIB12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00292110","article-title":"On sufficient-completenes and related properties of term rewriting systems","volume":"24","author":"Kapur","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(90)90023-B_BIB13","series-title":"Proceedings, 6th Conf. on Foundations of Software Technology and Theoretical Comput. Sci.","first-page":"426","article-title":"Complexity of sufficient completeness","volume":"Vol. 241","author":"Kapur","year":"1986"},{"key":"10.1016\/0890-5401(90)90023-B_BIB14","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebra","author":"Knuth","year":"1970"},{"key":"10.1016\/0890-5401(90)90023-B_BIB15","author":"Kuechlin","year":"1986"},{"key":"10.1016\/0890-5401(90)90023-B_BIB16","author":"Lewis","year":"1981"},{"key":"10.1016\/0890-5401(90)90023-B_BIB17","series-title":"Semigroup Forum 33","first-page":"331","article-title":"On two problems related to cancellativity","author":"Otto","year":"1986"},{"key":"10.1016\/0890-5401(90)90023-B_BIB18","series-title":"Mathematical Foundations of Computer Science 1980","first-page":"460","article-title":"New results on completeness and consistency of abstract data types","volume":"Vol. 88","author":"Padawitz","year":"1980"},{"key":"10.1016\/0890-5401(90)90023-B_BIB19","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\/0890-5401(90)90023-B_BIB20","article-title":"\u00c9tude des Syst\u00e8mes de Re\u00e9criture Conditionnels et Application aux Types Abstraits Alg\u00e9briques","author":"Remy","year":"1982","journal-title":"Th\u00e8se d'\u00c9tat"},{"key":"10.1016\/0890-5401(90)90023-B_BIB21","series-title":"Rewriting Techniques and Applications","first-page":"46","article-title":"Contextual rewriting","volume":"Vol. 202","author":"Zhang","year":"1985"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090023B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090023B?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:58Z","timestamp":1548897958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090023B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["089054019090023B"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90023-b","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}