{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:06:10Z","timestamp":1747548370983},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_50","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:45:29Z","timestamp":1330209929000},"page":"265-289","source":"Crossref","is-referenced-by-count":14,"title":["Proving termination of general Prolog programs"],"prefix":"10.1007","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dino","family":"Pedreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"13_CR1","unstructured":"K. R. Apt and M. Bezem. Acyclic programs. In D. H. D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 617\u2013633. The MIT Press, 1990."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89\u2013148. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"K. R. Apt and D. Pedreschi. Studies in pure Prolog: termination. In J.W. Lloyd, editor, Symposium on Computional Logic, pages 150\u2013176, Berlin, 1990. Springer-Verlag.","DOI":"10.1007\/978-3-642-76274-1_9"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493\u2013574. Elsevier, 1990. Vol. B.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"M. Baudinet. Proving termination properties of PROLOG programs. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science (LICS), pages 336\u2013347, Edinburgh, Scotland, 1988.","DOI":"10.1109\/LICS.1988.5131"},{"key":"13_CR6","unstructured":"M. Bezem. Characterizing termination of logic programs with level mappings. In E. L. Lusk and R. A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 69\u201380. The MIT Press, 1989."},{"key":"13_CR7","unstructured":"L. Cavedon. Continuity, consistency, and completeness properties for logic programs. In G. Levi and M. Martelli, editors, Proceedings of the Sixth International Conference on Logic Programming, pages 571\u2013584. The MIT Press, 1989."},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"8","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 8:69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0743-1066(85)90014-7","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting. A Kripke-Kleene semantics for general logic programs. Journal of Logic Programming, 2:295\u2013312, 1985.","journal-title":"Journal of Logic Programming"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","volume":"33","author":"S. Hanks","year":"1987","unstructured":"S. Hanks and D. McDermott. Nonmonotonic logic and temporal projection. Artificial Intelligence, 33:379\u2013412, 1987.","journal-title":"Artificial Intelligence"},{"key":"13_CR11","volume-title":"Introduction to Metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"S. C. Kleene. Introduction to Metamathematics. van Nostrand, New York, 1952."},{"key":"13_CR12","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, second edition, 1987.","edition":"second edition"},{"key":"13_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52837-7","volume-title":"Termination Proofs for Logic Programs","author":"L. Pl\u00fcmer","year":"1990","unstructured":"L. Pl\u00fcmer. Termination Proofs for Logic Programs. Lecture Notes in Artificial Intelligence 446, Springer-Verlag, Berlin, 1990."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer. Termination proofs for logic programs based on predicate inequalities. In D. H. D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 634\u2013648. The MIT Press, 1990.","DOI":"10.1007\/3-540-52837-7"},{"issue":"2","key":"13_CR15","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. J. ACM, 35(2):345\u2013373, 1988.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:12Z","timestamp":1605646452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}