{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:04:01Z","timestamp":1649131441456},"reference-count":30,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3893,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80598-x","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"1-20","source":"Crossref","is-referenced-by-count":12,"title":["Approximations for Strategies and Termination"],"prefix":"10.1016","volume":"70","author":[{"given":"Aart","family":"Middeldorp","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80598-X_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"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB2","series-title":"\u201cTerm Rewriting and All That\u201d","author":"Badder","year":"1998"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1006\/inco.1999.2838","article-title":"Sequentiality, monadic second-order logic and tree automata","volume":"157","author":"Comon","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Comon, H., M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi, Tree automata techniques and applications (1999), draft, available from http:\/\/www.grappa.univ-lille3.fr\/tata\/.","DOI":"10.1006\/inco.1998.2747"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB5","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":"Journal of Symbolic Computation"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Durand I. and A. Middeldorp, Decidable call by need computations in term rewriting (extended abstract), in: Proc. 14th CADE, LNAI 1249, 1997, pp. 4\u201318.","DOI":"10.1007\/3-540-63104-6_2"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Durand I. and A. Middeldorp, On the modularity of deciding call-by-need, in: Proc. FoSSaCS, LNCS 2030, 2001, pp. 199\u2013213.","DOI":"10.1007\/3-540-45315-6_13"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s002000100063","article-title":"Verification of Erlang processes by dependency pairs","volume":"12","author":"Giesl","year":"2001","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jsco.2002.0541","article-title":"Modular termination proofs for rewriting using dependency pairs","volume":"34","author":"Giesl","year":"2002","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB10","unstructured":"Giesl J. and E. Ohlebusch, Pushing the frontiers of combining rewrite systems farther outwards, in: Proc. FroCoS'98, Studies in Logic and Computation 7, Wiley, 2000 pp. 141\u2013160."},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB11","series-title":"Computational Logic, Essays in Honor of Alan Robinson","first-page":"396","article-title":"Computations in orthogonal rewriting systems, I and II","author":"Huet","year":"1991"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Jacquemard F., Decidable approximations of term rewriting systems, in: Proc. 7th RTA, LNCS 1103, 1996, pp. 362\u2013376.","DOI":"10.1007\/3-540-61464-8_65"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Jouanaud J.-P. and W. Sadfi, Strong sequentiality of left-linear overlapping rewrite systems, in: Proc. 4th CTRS, LNCS 968, 1995, pp. 235\u2013246.","DOI":"10.1007\/3-540-60381-6_14"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB14","series-title":"Handbook of Logic in Computer Science, Vol. 2","first-page":"1","article-title":"Term rewriting systems","author":"Klop","year":"1992"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB15","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)80598-X_NEWBIB16","unstructured":"Kusakari K., \u201cTermination, AC-Termination and Dependency Pairs of Term Rewriting Systems,\u201d Ph.D. thesis, JAIST (2000)."},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB17","unstructured":"Kusakari K. and Y. Toyama, On proving AC-termination by AC-dependency pairs, Research Report IS-RR-98-0026F, School of Information Science, JAIST (1998)."},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Middeldorp A., Approximating dependency graphs using tree automata techniques, in: Proc. IJCAR, LNAI 2083, 2001, pp. 593\u2013610.","DOI":"10.1007\/3-540-45744-5_49"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB19","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1006\/inco.2002.3157","article-title":"Decidability for left-linear growing term rewriting systems","volume":"178","author":"Nagaya","year":"2002","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB20","series-title":"\u201cComputing in Systems Described by Equations\u201d","author":"O'Donnell","year":"1977"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0020-0190(02)00272-7","article-title":"Hierarchical termination revisited","volume":"84","author":"Ohlebusch","year":"2002","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB22","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 Computation"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB23","doi-asserted-by":"crossref","unstructured":"Seki, H. T. Takai, Y. Fujinaka and Y. Kaji, Layered transducing term rewriting system and its recognizability preserving property, in: Proc. 13th RTA, LNCS 2378, 2002, pp. 98\u2013113.","DOI":"10.1007\/3-540-45610-4_8"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-1995-24123","article-title":"Simplification orderings: History of results","volume":"24","author":"Steinbach","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB25","doi-asserted-by":"crossref","unstructured":"Takai T., Y. Kaji and H. Seki, Right-linear finite path overlapping term rewriting systems effectively preserve recognizability, in: Proc. 11th RTA, LNCS 1833, 2000, pp. 246\u2013260.","DOI":"10.1007\/10721975_17"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB26","doi-asserted-by":"crossref","unstructured":"Tison, S., Tree automata and term rewrite systems (2000), invited tutorial at the 11th RTA.","DOI":"10.1007\/10721975_2"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","article-title":"Counterexamples to the termination for the direct sum of term rewriting systems","volume":"25","author":"Toyama","year":"1987","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB28","doi-asserted-by":"crossref","unstructured":"Toyama Y., Strong sequentiality of left-linear overlapping term rewriting systems, in: Proc. 7th LICS, 1992, pp. 274\u2013284.","DOI":"10.1109\/LICS.1992.185540"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB29","doi-asserted-by":"crossref","unstructured":"Urbain X., Automated incremental termination proofs for hierarchically defined term rewriting systems, in: Proc. IJCAR, LNAI 2083, 2001, pp. 485\u2013498.","DOI":"10.1007\/3-540-45744-5_42"},{"key":"10.1016\/S1571-0661(04)80598-X_NEWBIB30","series-title":"Term Rewriting Systems","article-title":"Termination","author":"Zantema","year":"2003"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480598X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480598X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:12:06Z","timestamp":1585897926000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610480598X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S157106610480598X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80598-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}