{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:27:56Z","timestamp":1720625276311},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":3406,"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":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82535-6","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T13:46:30Z","timestamp":1116510390000},"page":"188-207","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Outermost Ground Termination"],"prefix":"10.1016","volume":"71","author":[{"given":"Olivier","family":"Fissore","sequence":"first","affiliation":[]},{"given":"Isabelle","family":"Gnaedig","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82535-6_BIB1","series-title":"Technical Report 96\/39","article-title":"Proving innermost normalization automatically","author":"Arts","year":"1996"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB2","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"},{"issue":"2","key":"10.1016\/S1571-0661(05)82535-6_BIB3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","article-title":"Termination of rewriting systems by polynomial interpretations and its implementation","volume":"9","author":"Ben Cherifa","year":"1987","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB4","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An overview of ELAN. In C. Kirchner H. Kirchner, editors, Proceedings of the second International Workshop on Rewriting Logic and Applications, volume 15, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html, Pont-\u00e0-Mousson (France), September 1998. Electronic Notes in Theoretical Computer Science. Report LORIA 98-R-316.","DOI":"10.1016\/S1571-0661(05)82552-6"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB5","series-title":"Proceedings of the 1st International Workshop on Rewriting Logic and its Applications, volume 5 of Electronic Notes in Theoretical Computer Science","article-title":"Principles of Maude","author":"Clavel","year":"1996"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB6","unstructured":"Contejean E., March\u00e9 C., Monate B., Urbain X., CiME version 2. Prerelease available at http:\/\/cime.lri.fr."},{"key":"10.1016\/S1571-0661(05)82535-6_BIB7","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":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S1571-0661(05)82535-6_BIB8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","article-title":"Natural termination","volume":"142","author":"Dershowitz","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB9","series-title":"Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems","first-page":"244","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB10","series-title":"Selected papers of the 4th International Workshop on Strategies in Automated Deduction, volume 58 of Electronic Notes in Theoretical Computer Science.","article-title":"Termination of rewriting with local strategies","author":"Fissore","year":"2001"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB11","series-title":"Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming (PPDP)","article-title":"CARIBOO : An induction based proof tool for termination with strategies","author":"Fissore","year":"2002"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB12","series-title":"Technical report A02-R-493","article-title":"Outermost ground termination \u2013 Extended version","author":"Fissore","year":"2002"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB13","series-title":"Proceedings of the 1st IEEE Int","article-title":"An overview of CAFE specification environment \u2013 an algebraic approach for creating, verifying, and maintaining formal specifications over networks","author":"Futatsugi","year":"1997"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB14","series-title":"Technical Report A01-R-178","article-title":"Induction for innermost and outermost ground termination","author":"Gnaedig","year":"2001"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB15","article-title":"Attempts for generalizing the recursive path ordering","author":"Kamin","year":"1980","journal-title":"Unpublished manuscript"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB16","series-title":"Proceedigs of the Third International Workshop on Rewriting Logic and its Applications, volume 36 of Elecronic Notes In Theoretical Computer Science","article-title":"Termination and normalisation under strategy - Proofs in ELAN","author":"Kirchner","year":"2000"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1145\/151257.151260","article-title":"A meta-environment for generating programming environments","volume":"2","author":"Klint","year":"1993","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0304-3975(99)00215-7","article-title":"Some characteristics of strong normalization","volume":"239","author":"Krishna Rao","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB19","first-page":"210","article-title":"Well-quasi ordering, the tree theorem and Vazsonyi's conjecture","volume":"95","author":"Kruskal","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S1571-0661(05)82535-6_BIB20","series-title":"On proving term rewriting systems are noetherian. Technical report, Louisiana Tech","author":"Lankford","year":"1979"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB21","series-title":"Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR\u203201, volume 2250 of Lecture Notes in Artificial Intelligence","first-page":"669","article-title":"Termination of rewriting with strategy annotations","author":"Lucas","year":"2001"},{"issue":"3&4","key":"10.1016\/S1571-0661(05)82535-6_BIB22","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 Computation"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB23","article-title":"Compact normalisation trace via lazy rewriting","volume":"57","author":"Nguyen","year":"2001"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB24","series-title":"Proceedings of Static Analysis Symposium \u203297, volume 1302 of Lecture Notes in Computer Science","first-page":"345","article-title":"TEA: Automatically proving termination of programs in a non-strict higher-order functional language","author":"Panitz","year":"1997"},{"key":"10.1016\/S1571-0661(05)82535-6_BIB25","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","article-title":"Termination of term rewriting by semantic labelling","volume":"24","author":"Zantema","year":"1995","journal-title":"Fundamenta Informaticae"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825356?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T11:07:31Z","timestamp":1586257651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":25,"alternative-id":["S1571066105825356"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82535-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}