{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:22Z","timestamp":1725664102275},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575290"},{"type":"electronic","value":"9783540482116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57529-4_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:07:07Z","timestamp":1330243627000},"page":"114-124","source":"Crossref","is-referenced-by-count":6,"title":["Proving termination of logic programs by transforming them into equivalent term rewriting systems"],"prefix":"10.1007","author":[{"given":"G.","family":"Aguzzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Modigliani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","first-page":"129","volume-title":"Proceedings of LOPSTR '91","author":"F. Alexandre","year":"1991","unstructured":"F. Alexandre, K. Bsaies, and A. Qu\u00e9r\u00e9. On using mode input-output for transforming logic programs. In T.P. Clement and K.-K. Lau, editors, Proceedings of LOPSTR '91, pages 129\u2013146. Springer-Verlag, Berlin, 1991."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of MFCS'93","author":"K. Apt","year":"1993","unstructured":"K. Apt and S. Etalle. On the Unification Free Prolog Programs (Invited Lecture). To appear in S.Sokolowski, editor, Proceedings of MFCS'93, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1993."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-642-76274-1_9","volume-title":"Computational Logic","author":"K. Apt","year":"1990","unstructured":"K. Apt and D. Pedreschi. Studies in pure prolog: Termination. In J.W.Lloyd, editor, Computational Logic, pages 150\u2013176. Springer-Verlag, Berlin, 1990."},{"doi-asserted-by":"crossref","unstructured":"K. Apt and D. Pedreschi. Reasoning about termination of prolog programs. TR 14\/91, Dipartimento di Informatica, Universit\u00e1 di Pisa, 1991.","key":"9_CR4","DOI":"10.1007\/3-540-54415-1_50"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science, volume 494","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3540539816_66","volume-title":"Proceedings of TAPSOFT'91","author":"A. Bossi","year":"1991","unstructured":"A. Bossi, N. Cocco, and M. Fabris. Proving termination of logic programs by exploiting term properties. In Proceedings of TAPSOFT'91, Lecture Notes in Computer Science, volume 494, pages 153\u2013180. Springer-Verlag, Berlin, 1991."},{"unstructured":"F. Bronsard, T.K. Lakshman, and U.S. Reddy. A framework of directionality for proving termination of logic programs. In K. Apt, editor, Proceedings of JICSLP '92, pages 321\u2013335. The Mit Press, 1992.","key":"9_CR6"},{"issue":"1&2","key":"9_CR7","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&2):69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"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, chapter 6. Elsevier and The MIT Press, 1990.","key":"9_CR8","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"3","key":"9_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","volume":"5","author":"S.K. Debray","year":"1988","unstructured":"S.K. Debray and D.S. Warren. Automatic mode inference for logic programs. Journal of Logic Programming, 5(3):207\u2013229, 1988.","journal-title":"Journal of Logic Programming"},{"key":"9_CR10","first-page":"430","volume-title":"Lecture Notes in Computer Science, volume 656","author":"H. Ganzinger","year":"1992","unstructured":"H. Ganzinger and U. Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. In 3rd International Workshop on CTRS, Lecture Notes in Computer Science, volume 656, pages 430\u2013437. Springer-Verlag, Berlin, 1992."},{"key":"9_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 2nd edition, 1987.","edition":"2nd edition"},{"key":"9_CR12","volume-title":"Lecture Notes in Artificial Intelligence, volume 446","author":"L. Pl\u00fcmer","year":"1990","unstructured":"L. Pl\u00fcmer. Termination proofs for logic programs. In Lecture Notes in Artificial Intelligence, volume 446. Springer-Verlag, Berlin, 1990."},{"unstructured":"U. S. Reddy. Transformation of logic programs into functional programs. In International Symposium on Logic Programming, pages 187\u2013197. IEEE, 1984.","key":"9_CR13"},{"key":"9_CR14","first-page":"213","volume-title":"Lecture Notes in Computer Science, volume 626","author":"M. K. Rao","year":"1992","unstructured":"M.R.K. Krishna Rao, D. Kapur, and R.K. Shyamasundar. A transformational methodology for proving termination of logic programs. In 5th Conference on CSL, Lecture Notes in Computer Science, volume 626, pages 213\u2013226. Springer-Verlag, Berlin, 1992."},{"doi-asserted-by":"crossref","unstructured":"R.K. Shyamasundar, M.R.K. Krishna Rao, and D. Kapur. Rewriting concepts in the study of termination of logic programs. In Proc. ALPUK '92 Conference, London, April 1992.","key":"9_CR15","DOI":"10.1007\/978-1-4471-3421-3_1"},{"issue":"2","key":"9_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J. D. Ullman","year":"1988","unstructured":"J. D. Ullman and A. Van Gelder. Efficient tests for top-down termination of logical rules. Journal of ACM, 35(2):345\u2013373, 1988.","journal-title":"Journal of ACM"},{"unstructured":"T. Vasak and J. Potter. Characterization of terminating logic programs. In 3rd IEEE Symposium on Logic Programming, pages 140\u2013147, Salt Lake City, Utah, 1986.","key":"9_CR17"},{"key":"9_CR18","first-page":"301","volume-title":"Proceedings ICLP '91","author":"K. Verschaetse","year":"1991","unstructured":"K. Verschaetse and D. De Schreye. Deriving termination proofs for logic programs using abstract procedures. In Proceedings ICLP '91, pages 301\u2013315, Paris, June 1991. The MIT Press."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science, volume 310","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/BFb0012861","volume-title":"Proceedings of 9th CADE","author":"C. Walther","year":"1988","unstructured":"C. Walther. Argument-bounded algorithms as a basis for automated termination proofs. In Proceedings of 9th CADE, Lecture Notes in Computer Science, volume 310, pages 602\u2013621. Springer-Verlag, Berlin, 1988."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57529-4_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:33:43Z","timestamp":1687271623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57529-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575290","9783540482116"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57529-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}