{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:09:44Z","timestamp":1774332584915,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90175-6","type":"journal-article","created":{"date-parts":[[2003,5,28]],"date-time":"2003-05-28T02:32:36Z","timestamp":1054089156000},"page":"323-328","source":"Crossref","is-referenced-by-count":23,"special_numbering":"C","title":["On recursive path ordering"],"prefix":"10.1016","volume":"40","author":[{"given":"M.S.","family":"Krishnamoorthy","sequence":"first","affiliation":[]},{"given":"P.","family":"Narendran","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90175-6_BIB1","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":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90175-6_BIB2","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0304-3975(85)90175-6_BIB3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0212012","article-title":"On proving uniform termination and restricted termination of rewriting systems","volume":"12","author":"Guttag","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0304-3975(85)90175-6_BIB4","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\/0304-3975(85)90175-6_BIB5","article-title":"On the uniform halting problem for term rewriting systems","volume":"283","author":"Huet","year":"1978"},{"key":"10.1016\/0304-3975(85)90175-6_BIB6","series-title":"Formal Description of Programming Concepts - II","first-page":"331","article-title":"Recursive decomposition ordering","author":"Jouannaud","year":"1983"},{"key":"10.1016\/0304-3975(85)90175-6_BIB7","series-title":"Proc. Colloquium on Trees in Algebra and Programming (CAAP'85)","article-title":"A path ordering for proving termination of term rewriting systems","author":"Kapur","year":"1985"},{"key":"10.1016\/0304-3975(85)90175-6_BIB8","series-title":"Proc. NSF Workshop on Rewrite Rule Laboratory","article-title":"Architecture of and experiments with RRL, a rewrite rule laboratory","author":"Kapur","year":"1983"},{"key":"10.1016\/0304-3975(85)90175-6_BIB9","series-title":"Computational Problems in Abstract Algebras","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(85)90175-6_BIB10","article-title":"On proving term rewriting systems are noetherian","author":"Lankford","year":"1979"},{"key":"10.1016\/0304-3975(85)90175-6_BIB11","series-title":"10th POPL Conf.","article-title":"Computer experiments with the REVE term rewriting system generator","author":"Lescanne","year":"1983"},{"key":"10.1016\/0304-3975(85)90175-6_BIB12","unstructured":"D.A. Plaisted, A recursively defined ordering for proving termination of term rewriting systems, Rept. R78-943, Dept. of Computer Science, Univ. of Illinois, Urbana, IL"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901756?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901756?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T01:54:14Z","timestamp":1553133254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":12,"alternative-id":["0304397585901756"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90175-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}