Reasoning about termination of pure prolog programs

Information and Computation

Volumn 106, Issue 1, 1993, Pages 109-157

  Apt, Krzysztof R ^a,b   Pedreschi, Dino ^c  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001609012     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1993.1051     Document Type: Article

References (27)

1. Apt, K. R. (1990), Logic programming, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 493-574, Elsevier, Amsterdam.
2. Apt, K. R., and Bezem, M. (1990), Acyclic programs, in "Proceedings of the Seventh International Conference on Logic Programming" (D. H. D. Warren and P. Szeredi, Eds.), pp. 617-633, MIT Press, Cambridge, MA.
3. Apt, K. R., Blair, H. A., and Walker, A. (1988), Towards a theory of declarative knowledge, in "Foundations of Deductive Databases and Logic Programming" (J. Minker, Ed.), pp. 89-148, Morgan Kaufmann.
4. Apt, K. R. and Doets, K. (1992), A New Definition of SLDNF-Resolution," ILLC Prepublication Series CT-92-03, Department of Mathematics and Computer Science, University of Amsterdam.
5. Apt, K. R., Palamidessi, C., and Marchiori, E. (1992), A theory of First-order built-in's of Prolog, in "Proceeding of the Third International Conference on Algebraic and Logic Programming (ALP 92)" (H. Kirchner and G. Levi, Ed.), pp. 69-83, Lecture Notes in Computer Science, Vol. 632, Springer-Verlag, Berlin.
6. Apt, K. R., and Pedreschi, D. (1990), Studies in pure Prolog: Termination, in "Symposium on Computional Logic" (J. W. Lloyd, Ed.), pp. 150-176, Springer-Verlag, Berlin.
7. Apt, K. R., and Pedreschi, D. (1991), Proving termination of general Prolog programs, in "Proceeding of the International Conference on Theoretical Aspects of Computer Software" (T. Ito and A. Meyer, Eds.), pp. 265-289, Lecture Notes in Computer Science, Vol. 526, Springer-Verlag, Berlin.
8. Bal Wang, and Shyamasundar, R. K. (1991), Methodology for proving termination of logic programs, in "Proceedings STACS '91" (M. Jantzen, Ed.), pp. 214-227, Lecture Notes in Computer Science, Vol. 480, Springer-Verlag, Berlin.
9. Baudinet, M. (1988), Proving termination properties of PROLOG programs, in "Proceedings of the 3rd Annual Symposium on Logic in Computer Science (LICS)," Edinburgh, Scotland, pp. 336-347.
10. Bezem, M. (1989), Characterizing termination of logic programs with level mappings, in "Proceedings of the North American Conference on Logic Programming" (E. L. Lusk and R. A. Overbeek, Eds.), pp. 69-80, MIT Press, Cambridge, MA.
11. Bossi, A., Cocco, N., and Fabris, M. (1991), Termination of logic programs by exploiting term properties, in "Proceedings CCPSD-TAPSOFT '91" (S. Abramsky and T. S. E. Maibaum, Eds.), pp. 153-180, Lecture Notes in Computer Science, Vol.494, Springer- Verlag, Berlin.
12. Cavedon, L. (1989), Continuity, consistency, and completeness properties for logic programs, in "Proceedings of the Sixth International Conference on Logic Programming" (G. Levi and M. Martelli, Eds.), pp. 571-584, MIT Press, Cambridge, MA.
13. Dershowitz, N. (1987), Termination of rewriting, J. Symbolic Comput. 8, 69-116.
14. Deville, Y. (1990), "Logic Programming. Systematic Program Development," International Series in Logic Programming, Addison-Wesley.
15. Fitting, M. (1985), A Kripke-Kleene semantics for general logic programs, J. Logic Programming 2, 295-312.
16. Floyd, R. W. (1967), Assigning meanings to programs, in "Proceedings Symposium on Applied Mathematics, 19, Mathematical Aspects in Computer Science," pp. 19-32. Amer. Math. Soc., Providence, RI.
17. Hanks, S., and McDermott, D. (1987), Nonmonotonic logic and temporal projection, Arlif. Intell. 33, 379-412.
18. Kleene, S. C. (1952). "Introduction to Metamathematics," Van Nostrand, New York.
19. Lloyd, J. W. (1987), "Foundations of Logic Programming," 2nd ed., Springer-Verlag, Berlin.
20. Mellish, C. S. (1981), "The Automatic Generation of Mode Declarations for Prolog Programs," DAI Research Paper 163, Department of Artificial Intelligence, Univ. of Edinburgh.
21. Pedreschi, D., and Pieramico, C. (1992), "Partial automation of termination proofs for Prolog Programs," Technical Report, Department of Computer Science, Univ. of Pisa, to appear.
22. Plümer, P. (1990a), "Termination Proofs for Logic Programs," Lecture Notes in Artificial Intelligence, Vol. 446, Springer-Verlag, Berlin.
23. Plümer, L. (1990b), Termination proofs for logic programs based on predicate inequalities, in "Proceedings of the Seventh International Conference on Logic Programming" (D. H. D. Warren and P. Szeredi, Eds.), pp. 634-648, MIT Press, Cambridge, MA.
24. Shostak, R. E. (1977), On the SUP-INF method for proving Presburger formulas, J. Assoc. Comput. Mach. 24, No. 4, 529-543.
25. Sterling, L., and Shapiro, S. (1986), "The Art of Prolog," MIT Press, Cambridge, MA.
26. Ullman, J. D., and van Gelder (1988), Efficient tests for top-down termination of logical rules, J. Assoc. Comput. Mach. 35, No. 2, 345-373.
27. Vasak, T., and Potter, J. (1986), Characterization of terminating logic programs, in "Proceedings of the 1986 IEEE Symposium on Logic Programming."