{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:36:38Z","timestamp":1762623398670},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610649"},{"type":"electronic","value":"9783540499442"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61064-2_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:15:14Z","timestamp":1330272914000},"page":"196-210","source":"Crossref","is-referenced-by-count":5,"title":["Termination by absence of infinite chains of dependency pairs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Arts","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","unstructured":"Thomas Arts. A technique for automatically proving termination of constructor systems. Technical Report UU-CS-1995-17, Utrecht University, October 1995."},{"key":"15_CR2","unstructured":"Thomas Arts and Hans Zantema. Termination of logic programs via labelled term rewrite systems. In Proceedings of CSN 1995. Sion, November 1995. Full version appeared as technical report UU-CS-1994-20."},{"issue":"1","key":"15_CR3","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):69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013320. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"15_CR5","first-page":"204","volume":"850","author":"M. Ferreira","year":"1994","unstructured":"Maria Ferreira and Hans Zantema. Syntactical analysis of total termination. Proceedings of ALP'94, LNCS(850):204\u2013222, September 1994.","journal-title":"LNCS"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"J. Giesl. Termination analysis for functional programs using term orderings. In Proceedings of the Second International Static Analysis Symposium, LNCS 983, Glasgow, Scotland, 1995.","DOI":"10.1007\/3-540-60360-3_38"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-24121","volume":"24","author":"B. Gramlich","year":"1995","unstructured":"Bernhard Gramlich. Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3\u201323, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\u201320","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The intergration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19\u201320:583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"15_CR9","unstructured":"G. Huet and D. Lankford. On the uniform halting problem for term rewriting systems. Technical Report report 283, INRIA, 1978."},{"key":"15_CR10","volume-title":"volume 353 of LNAI","author":"S. H\u00f6lldobler","year":"1989","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming, volume 353 of LNAI. Springer-Verlag, Berlin, 1989. Subseries of LNCS."},{"key":"15_CR11","first-page":"318","volume":"87","author":"J.M. Hullot","year":"1980","unstructured":"J.M. Hullot. Canonical forms and unification. 5th International Conference on Automated Deduction, LNCS(87):318\u2013334, 1980.","journal-title":"LNCS"},{"key":"15_CR12","unstructured":"Richard Kennaway. Complete term rewrite systems for decimal arithmetic and other total recursive functions. Workshop on Termination, La Bresse, France, May 1995."},{"key":"15_CR13","first-page":"1","volume-title":"Handbook of Logic in Computer Science, volume 2","author":"J.W. Klop","year":"1992","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, New York, 1992."},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J.H. Siekmann","year":"1989","unstructured":"J.H. Siekmann. Unification theory. Journal of Symbolic Computation, 7:207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"15_CR15","first-page":"11","volume":"914","author":"J. Steinbach","year":"1995","unstructured":"Joachim Steinbach. Automatic termination proofs with transformation orderings. Proceedings of RTA-95, LNCS(914):11\u201326, April 1995.","journal-title":"LNCS"},{"key":"15_CR16","doi-asserted-by":"crossref","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":"15_CR17","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 lnformaticae, 24:89\u2013105, 1995. Our technical reports and papers are available at http: \/\/www. cs. ruu.nl\/\u223cthomas","journal-title":"Fundamenta lnformaticae"}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61064-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:29:14Z","timestamp":1619558954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61064-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610649","9783540499442"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61064-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}