{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:47:55Z","timestamp":1649029675606},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90105-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"257-262","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of recursive path orderings"],"prefix":"10.1016","volume":"46","author":[{"given":"Wayne","family":"Snyder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90105-I_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(93)90105-I_BIB2","first-page":"462","article-title":"Basic paramodulation and superposition","volume":"607","author":"Bachmair","year":"1992"},{"key":"10.1016\/0020-0190(93)90105-I_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(82)90015-1","article-title":"An efficient functional implementation of FIFO queues","volume":"14","author":"Burton","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90105-I_BIB4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of Rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0020-0190(93)90105-I_BIB5","series-title":"Handbook of Theoretical Computer Science","article-title":"Rewrite Systems","author":"Dershowitz","year":"1990"},{"issue":"3","key":"10.1016\/0020-0190(93)90105-I_BIB6","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1145\/116825.116833","article-title":"Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method","volume":"38","author":"Hsiang","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90105-I_BIB7","unstructured":"S. Kamin and J.-J. Levy, Two generalizations of the recursive path ordering, Unpublished note, Dept. of Computer Science, University of Illinois, Urbana, IL."},{"key":"10.1016\/0020-0190(93)90105-I_BIB8","first-page":"173","article-title":"A path ordering for proving termination of term rewriting systems","volume":"185","author":"Kapur","year":"1985"},{"key":"10.1016\/0020-0190(93)90105-I_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(85)90175-6","article-title":"On recursive path ordering","volume":"40","author":"Krishnamoorthy","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(93)90105-I_BIB10","first-page":"634","article-title":"Two implementations of the recursive path ordering on monadic terms","author":"Lescanne","year":"1981","journal-title":"Proc. 19th Allerton Conf. on Communication, Control, and Computing"},{"key":"10.1016\/0020-0190(93)90105-I_BIB11","unstructured":"D. Plaisted, A recursively defined ordering for proving termination of term rewriting systems, Tech. Rept. R78- 943, Dept. of Computer Science, University of Illinois at Champagne-Urbana, IL."},{"key":"10.1016\/0020-0190(93)90105-I_BIB12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0747-7171(87)80023-8","article-title":"Path of subterms ordering and recursive decomposition ordering revisited","volume":"3","author":"Rusinowitch","year":"1987","journal-title":"J. Symbolic Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390105I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390105I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:49Z","timestamp":1555132909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390105I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390105I"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90105-i","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}