{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T23:33:08Z","timestamp":1761607988143,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3558,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["15500007"],"award-info":[{"award-number":["15500007"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004823","name":"Nagoya University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s1571-0661(04)80693-5","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"52-69","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Narrowing-based simulation of term rewriting systems with extra variables and its Termination Proof"],"prefix":"10.1016","volume":"86","author":[{"given":"Naoki","family":"Nishida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Sakai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiki","family":"Sakabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","article-title":"Termination of term rewriting using dependency pairs","volume":"236","author":"Arts","year":"2000","journal-title":"Theoretical Computer Science"},{"year":"1998","series-title":"\u201cTerm Rewriting and All That\u201d","author":"Baader","key":"10.1016\/S1571-0661(04)80693-5_NEWBIB2"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Christian J., Some termination criteria for narrowing and E-narrowing, in: D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, LNAI 607, 1992, pp. 582\u2013588.","DOI":"10.1007\/3-540-55602-8_193"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Hanus M., On extra variables in (equational) logic programming, in: Proceedings of the 12th International Conference on Logic Programming (1995), pp. 665\u2013679.","DOI":"10.7551\/mitpress\/4298.003.0065"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB5","unstructured":"Huet G., and J.-J. L\u00e8vy, Call-by-need computations in non-ambiguous linear term rewriting systems, Technical Report 359, INRIA (1979)."},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB6","series-title":"Computational Logic: Essays in Honor of Alan Robinson","first-page":"395","article-title":"Computations in orthogonal rewriting systems, I and II","author":"Huet","year":"1991"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Hullot J.-M., Canonical forms and unification, in: Proceedings of the 5th International Conference on Automated Deduction, LNCS 87, 1980, pp. 318\u2013334.","DOI":"10.1007\/3-540-10009-1_25"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB8","first-page":"2","article-title":"Term rewriting systems","volume":"2","author":"Klop","year":"1992"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","article-title":"Sequentiality in orthogonal term rewriting systems","volume":"12","author":"Klop","year":"1991","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Kusakari K., M. Nakamura and Y. Toyama, Argument filtering transformation, in: Proceedings of International Conference on Principles and Practice of Declarative Programming, LNCS 1702, 1999, pp. 47\u201361.","DOI":"10.1007\/10704567_3"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","article-title":"Completeness results for basic narrowing","volume":"5","author":"Middeldorp","year":"1994","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB12","article-title":"Complete selection functions for a lazy conditional narrowing calculus","volume":"2002","author":"Middeldorp","year":"2002","journal-title":"Journal of Functional and Logic Programming"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB13","unstructured":"Nagaya T., M. Sakai and Y. Toyama, NVNF-sequentiality of left-linear term rewriting systems, Technical Report 918, RIMS (1995)."},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB14","unstructured":"Nishida N., M. Sakai and T. Sakabe, Improving efficiency of computation of right-linear constructor term rewriting systems with extra variables, in: Proceedings of the 20th Conference of Japan Society for Software Science and Technology, 1992, in Japanese."},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB15","unstructured":"Nishida N., M. Sakai and T. Sakabe, Generation of a TRS implementing the inverses of the functions with specified arguments fixed, Technical Report COMP 2001\ue4f867, the Institute of Electronics, Information and Communication Engineers (2001), in Japanese."},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB16","unstructured":"Nishida N., M. Sakai and T. Sakabe, Generation of inverse term rewriting systems for pure treeless functions, in: Y. Toyama, editor, Proceedings of Rewriting in Proof and Computation, 2001, pp. 188\u2013198."},{"year":"2002","series-title":"\u201cAdvanced Topics in Term Rewriting\u201d","author":"Ohlebusch","key":"10.1016\/S1571-0661(04)80693-5_NEWBIB17"},{"key":"10.1016\/S1571-0661(04)80693-5_NEWBIB18","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/0222010","article-title":"NV-sequentiality: a decidable condition for call-by-need computations in term rewriting systems","volume":"22","author":"Oyamaguchi","year":"1993","journal-title":"SIAM Journal on Computing"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806935?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806935?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T23:29:41Z","timestamp":1761607781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S1571066104806935"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80693-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Narrowing-based simulation of term rewriting systems with extra variables and its Termination Proof","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80693-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}