{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:29Z","timestamp":1725663389629},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562825"},{"type":"electronic","value":"9783540475057"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56282-6_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:00:32Z","timestamp":1330254032000},"page":"70-88","source":"Crossref","is-referenced-by-count":15,"title":["Tutorial on termination of logic programs"],"prefix":"10.1007","author":[{"given":"Danny","family":"Schreye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristof","family":"Verschaetse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"K. R. Apt","year":"1991","unstructured":"K.R. Apt and M. Bezem, Acyclic programs, New Generation Computing, 9, 1991, pp. 335\u2013363.","journal-title":"New Generation Computing"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"K.R. Apt and D. Pedreschi, Studies in pure Prolog: termination, in Proceedings of the Esprit symposium on computational logic, ed. J.W. Lloyd, 1990, pp. 150\u2013176.","DOI":"10.1007\/978-3-642-76274-1_9"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"K.R. Apt and D. Pedreschi, Proving termination of general Prolog programs, in Proceedings International Conference on Theoretical Aspects of Computer Science, Sendai, Japan, 1991.","DOI":"10.1007\/3-540-54415-1_50"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Baudinet, Proving termination properties of Prolog programs: a semantic approach, in Proceedings of the 3rd IEEE symposium on logic in computer science, Edinburgh, 1988, pp. 336\u2013347. Revised version to appear in Journal of Logic Programming.","DOI":"10.1109\/LICS.1988.5131"},{"key":"5_CR5","unstructured":"M. Bezem, Characterising termination of logic programs with level mappings, Proceedings NACLP89, eds. E.L. Lusk and R.A. Overbeek, 1989, pp. 69\u201380. Revised version will appear in Journal of Logic Programming."},{"key":"5_CR6","volume-title":"Technical Report CS-R9134","author":"R. N. Bol","year":"1991","unstructured":"R. N. Bol, Loop checking in partial deduction, Technical Report CS-R9134, Centre for mathematics and computer science, Amsterdam, 1991."},{"key":"5_CR7","first-page":"153","volume":"494","author":"A. Bossi","year":"1991","unstructured":"A. Bossi, N. Cocco and M. Fabris, Proving termination of logic programs by exploiting term properties, in Proceedings CCPSD-TAPSOFT '91, Springer-Verlag, LNCS 494, 1991, pp. 153\u2013180.","journal-title":"Proceedings CCPSD-TAPSOFT '91, Springer-Verlag, LNCS"},{"key":"5_CR8","unstructured":"A. Bossi, N. Cocco and M. Fabris, Norms on terms and their use in proving universal termination of a logic program, Technical Report 4\/29, CNR, Department of Mathematics, University of Padova, March 1991."},{"key":"5_CR9","first-page":"117","volume-title":"Proceedings ILPS'91","author":"M. Bruynooghe","year":"1991","unstructured":"M. Bruynooghe, D. De Schreye and B. Martens, A general criterion for avoiding infinite unfolding during partial deduction, in Proceedings ILPS'91, San Diego, 1991, MIT Press, pp. 117\u2013131."},{"key":"5_CR10","unstructured":"L. Cavedon, Continuity, consistency, and completeness properties for logic programs, in Proceedings ICLP89, eds. G. Levi and M. Martelli, 1989, pp. 571\u2013584."},{"key":"5_CR11","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, 1987, pp. 69\u2013116.","journal-title":"Journal of Symbolic Computation"},{"key":"5_CR12","unstructured":"D. De Schreye and K. Verschaetse, Termination analysis of definite logic programs with respect to call patterns, Technical Report CW 138, Department Computer Science, K.U.Leuven, January 1992."},{"key":"5_CR13","unstructured":"D. De Schreye, K. Verschaetse and M. Bruynooghe, A framework for analysing the termination of definite logic programs, in Proceedings FGCS92, ICOT, 1992, pp.:481\u2013488."},{"issue":"1&2","key":"5_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(90)90066-Q","volume":"75","author":"P. Devienne","year":"1990","unstructured":"P. Devienne, Weighted graphs: a tool for studying the halting problem and time complexity in term rewriting systems and logic programming, Theoretical Computer Science, 75 (1&2), 1990, pp. 157\u2013215.","journal-title":"Theoretical Computer Science"},{"key":"5_CR15","unstructured":"G. Janssens and M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, Technical Report CW 107, Department of Computer Science, K.U.Leuven, March 1990. To appear in Journal of Logic Programming."},{"key":"5_CR16","unstructured":"Z. Manna and S. Ness, On the termination of Markov algorithms, pp. 784\u2013792 in Proc. 3rd Hawaii Int. Conf. on Syst. Sci., Honolulu, Hawaii (1970)."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer, Termination proofs of logic programs, LNCS 446, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"5_CR18","first-page":"634","volume-title":"Proceedings ICLP'90","author":"L. Pl\u00fcmer","year":"1990","unstructured":"L. Pl\u00fcmer, Termination proofs for logic programs based on predicate inequalities, in Proceedings ICLP'90, Jerusalem, 1990, MIT Press, pp. 634\u2013648."},{"key":"5_CR19","first-page":"503","volume-title":"Proceedings ILPS'91","author":"L. Pl\u00fcmer","year":"1991","unstructured":"L. Pl\u00fcmer, Automatic termination proofs for Prolog programs operating on nonground terms, in Proceedings ILPS'91, San Diego, 1991, MIT Press, pp. 503\u2013517."},{"key":"5_CR20","unstructured":"M. R. K. Krishna Rao, D. Kapur and R. K. Shyamasundar, A transformational methodology for proving termination of logic programs, in Proceedings Computer Science Logic, CSL91, 1991."},{"key":"5_CR21","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 Proceedings ALPUK92, 1992.","DOI":"10.1007\/978-1-4471-3421-3_1"},{"issue":"2","key":"5_CR22","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), 1988, pp. 345\u2013373.","journal-title":"J. ACM"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, Deriving constraints among argument sizes in logic programs, in Proceedings 9th symposium on principles of database systems, ACM Press, 1990, pp. 47\u201360.","DOI":"10.1145\/298514.298541"},{"key":"5_CR24","unstructured":"T. Vasak and J. Potter, Characterisation of terminating logic programs, in Proceedings 1986 symposium on logic programming, Salt Lake City, 1986, pp. 140\u2013147."},{"key":"5_CR25","unstructured":"K. Verschaetse, Static termination analysis for definite Horn clause programs, Ph.D.-thesis, K.U. Leuven, 1992."},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"K. Verschaetse and D. De Schreye, Derivation of linear size relations by abstract interpretation, in Proc. PLILP92, 1992, to appear.","DOI":"10.1007\/3-540-55844-6_143"}],"container-title":["Lecture Notes in Computer Science","Meta-Programming in Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56282-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:10Z","timestamp":1605646990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56282-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562825","9783540475057"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-56282-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}