{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171783},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030602","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:10:41Z","timestamp":1133417441000},"page":"261-272","source":"Crossref","is-referenced-by-count":16,"title":["Automatically proving termination where simplification orderings fail"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Arts","sequence":"first","affiliation":[]},{"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"21_CR1","first-page":"63","volume":"1103","author":"T. Arts","year":"1996","unstructured":"T. Arts and J. Giesl. Termination of constructor systems. In Proceedings of RTA-96, LNCS 1103, pages 63\u201377, July 1996.","journal-title":"LNCS"},{"key":"21_CR2","volume-title":"Technical Report UU-CS-1996-44","author":"T. Arts","year":"1996","unstructured":"T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. Technical Report UU-CS-1996-44, Utrecht University, Utrecht, October 1996"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proceedings of RTA '97, June 2\u20134, 1997.","DOI":"10.1007\/3-540-62950-5_68"},{"key":"21_CR4","first-page":"196","volume":"1059","author":"T. Arts","year":"1996","unstructured":"T. Arts. Termination by absence of infinite chains of dependency pairs. In Proceedings of CAAP'96, LNCS 1059, pages 196\u2013210, April 1996.","journal-title":"LNCS"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. Cherifa Ben","year":"1987","unstructured":"A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137\u2013159, 1987.","journal-title":"Science of Computer Programming"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01810293","volume":"1","author":"F. Bellegarde","year":"1990","unstructured":"F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1:79\u201396, 1990.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"21_CR7","first-page":"448","volume":"115","author":"N. Dershowitz","year":"1981","unstructured":"N. Dershowitz. Termination of linear rewriting systems. In Proceedings of ALP'81, LNCS 115, pages 448\u2013458, July 1981.","journal-title":"LNCS"},{"issue":"1","key":"21_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 and 2):69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz and C. Hoot. Natural termination. Theoretical Computer Science, 142(2):179\u2013207, 1995.","journal-title":"Theoretical Computer Science"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume B, pages 243\u2013320, North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"21_CR11","volume-title":"Technical Report MIP-8922 283","author":"O. Geupel","year":"1989","unstructured":"O. Geupel. Overlap closures and termination of term rewriting systems. Technical Report MIP-8922 283, Universit\u00e4t Passau, Passau, Germany, 1989."},{"key":"21_CR12","first-page":"426","volume":"914","author":"J. Giesl","year":"1995","unstructured":"J. Giesl. Generating polynomial orderings for termination proofs. In Proceedings of RTA-95, LNCS 914, pages 426\u2013431, April 1995.","journal-title":"LNCS"},{"key":"21_CR13","volume-title":"Technical Report 283","author":"G. Huet","year":"1978","unstructured":"G. Huet and D. Lankford. On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Le Chesnay, France, 1978."},{"key":"21_CR14","volume-title":"Department of Computer Science","author":"S. Kamin","year":"1980","unstructured":"S. Kamin and J.-J. Levy. Two generalizations of the recursive path ordering. Department of Computer Science, University of Illinois, IL, 1980."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(95)00075-8","volume":"151","author":"M. R. K. K. Rao","year":"1995","unstructured":"M. R. K. Krishna Rao. Modular proofs for completeness of hierarchical term rewriting systems. Theoretical Computer Science, 151:487\u2013512, 1995.","journal-title":"Theoretical Computer Science"},{"key":"21_CR16","volume-title":"Technical Report Memo MTP-3","author":"D. S. Lankford","year":"1979","unstructured":"D. S. Lankford. On proving term rewriting systems are noetherian. Technical Report Memo MTP-3, Louisiana Tech. University, Ruston, LA, 1979."},{"key":"21_CR17","unstructured":"D. S. Lankford and D. R. Musser. A finite termination criterion, 1978."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(94)90032-9","volume":"49","author":"J. Steinbach","year":"1994","unstructured":"J. Steinbach. Generating polynomial orderings. Information Processing Letters, 49:85\u201393, 1994.","journal-title":"Information Processing Letters"},{"key":"21_CR19","first-page":"11","volume":"914","author":"J. Steinbach","year":"1995","unstructured":"J. Steinbach. Automatic termination proofs with transformation orderings. In Proceedings of RTA-95, LNCS 914, pages 11\u201325, April 1995. Long version appeared as Tech. Report SR-92-23, Univ. Kaiserslautern, Germany, 1992.","journal-title":"LNCS"},{"key":"21_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-1995-24123","volume":"24","author":"J. Steinbach","year":"1995","unstructured":"J. Steinbach. Simplification orderings: history of results. Fundamenta Informaticae, 24:47\u201387, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141\u2013143, 1987.","journal-title":"Information Processing Letters"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17:23\u201350, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89\u2013105, 1995.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:20:58Z","timestamp":1586593258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0030602","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}