On modular termination proofs of general logic programs

Theory and Practice of Logic Programming

Volumn 2, Issue 3, 2002, Pages 263-291

  Bossi, Annalisa ^a   Cocco, Nicoletta ^a   Rossi, Sabina ^a   Etalle, Sandro ^b,c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c CWI   (Netherlands)

Author keywords

Logic programming; Termination; Verification

Indexed keywords

EID: 0346041925     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068402001382     Document Type: Article

References (31)

1. Apt, K. R. (1990) Introduction to logic programming. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, pp. 495-574. Elsevier/MIT Press.
2. Apt, K. R. (1997) From Logic Programming to Prolog. Prentice Hall.
3. Apt, K. R. and Etalle, S. (1993) On the unification free Prolog programs. In: A. Borzyszkowski and S. Sokolowski (eds.), Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS 93): Lecture Notes in Computer Science 711, pp. 1-19. Springer-Verlag.
4. Apt, K. R. and Luitjes, I. (1995) Verification of logic programs with delay declarations. In: A. Borzyszkowski and S. Sokolowski (eds.), Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology, (AMAST'95): Lecture Notes in Computer Science 936, pp. 1-19. Springer-Verlag.
5. Apt, K. R. and Pedreschi, D. (1993) Reasoning about termination of pure Prolog programs. Information & Computation, 106(1), 109-157.
6. Apt, K. R. and Pedreschi, D. (1994) Modular termination proofs for logic and pure Prolog programs. In: G. Levi (ed.), Advances in Logic Programming Theory, pp. 183-229. Oxford University Press.
7. Apt, K. R. and Pellegrini, A. (1994) On the occur-check free Prolog programs. ACM Trans. Programming Languages and Systems, 16(3), 687-726.
8. Bezem, M. (1993) Strong termination of logic programs. Journal of Logic Programming, 15(1&2), 79-97.
9. Bronsard, F., Lakshman, T. K. and Reddy, U. S. (1992). A framework of directionality for proving termination of logic programs. In: K. R. Apt (ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 321-335. MIT Press.
10. Cavedon, L. (1989) Continuity, consistency and completeness properties for logic programs. In: G. Levi and M. Martelli (eds.), Proceedings of the Sixth International Conference on Logic Programming, pp. 571-584. MIT Press.
11. Clark, K. L. (1978) Negation as failure rule. In: H. Gallaire and G. Minker (eds.), Logic and Data Bases, pp. 293-322. Plenum Press.
12. Codish, M. and Demoen, B. (1995) Analyzing logic programs using 'prop'-ositional logic programs and a magic wand. Journal of Logic Programming, 25(3), 249-274.
13. Codish, M. and Taboch, C. (1999) A semantic basis for the termination analysis of logic programs. Journal of Logic Programming, 41(1), 103-123.
14. De Schreye, D., Verschaetse, K. and Bruynooghe, M. (1992) A framework for analyzing the termination of definite logic programs with respect to call patterns. In: I. Staff (ed.), Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'92), pp. 481-488. Tokyo, Japan.
15. Debray, S. K. (1989) Static inference of modes and data dependencies in logic programs. ACM Trans. Programming Languages and Systems, 11(3), 418-450.
16. Debray, S. K. and Warren, D. S. (1988) Automatic mode inference for logic programs. Journal of Logic Programming, 5(3), 207-229.
17. Decorte, S., De Schreye, D. and Vandecasteele, H. (1999) Constraint-based termination analysis of logic programs. ACM Trans. Programming Languages and Systems, 21(6), 1137-1195.
18. Dembiński, P. and Maluszyński, J. (1985) AND-parallelism with intelligent backtracking for annotated logic programs. Proceedings of the International Symposium on Logic Programming, pp. 29-38. Boston, MA.
19. Drabent, W. (1987) Do logic programs resemble programs in conventional languages? In: E. Wada (ed.), Proceedings International Symposium on Logic Programming, pp. 389-396. IEEE Computer Society.
20. Etalle, S., Bossi, A. and Cocco, N. (1999) Termination of well-moded programs. Journal of Logic Programming, 38(2), 243-257.
21. Gabbrielli, M. and Giacobazzi, R. (1994) Goal independency and call patterns in the analysis of logic programs. Proceedings 9th ACM Symposium on Applied Computing, pp. 394-399. ACM Press.'
22. Janssen, G. and Bruynooghe, M. (1992) Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2-3), 205-258.
23. Lloyd, J. W. (1987) Foundations of Logic Programming, Symbolic Computation - Artificial Intelligence( 2nd ed.) Springer-Verlag.
24. Marchiori, E. (1996) Practical methods for proving termination of general logic programs. Journal of Artificial Intelligence Research, 4, 179-208.
25. Pedreschi, D. and Ruggieri, S. (1996) Modular verification of logic programs. In: F. de Boer and M. Gabbrielli (eds.), Proceedings of the W2 Post-Conference Workshop of the 1996 JLCSLP. Bonn, Germany, http://www.di.unipi.it/∼gabbri/w2.html.
26. Pedreschi, D. and Ruggieri, S. (1999) Verification of logic programs. Journal of Logic Programmingk 39(1-3)k 125-176.
27. Rosenblueth, D. (1991) Using program transformation to obtain methods for eliminating backtracking in fixed-mode logic programs. Technical Report 7, Universidad Nacional Autonoma de Mexico, Instituto de Investigaciones en Matematicas Aplicadas y en Sistemas.
28. Speirs, C., Somogyi, Z. and Sondergaard., H. (1997) Termination analysis for Mercury. In: P. V. Hentenryck (ed.), Proceedings 4th International Static Analysis Symposium, (SAS'97): Lecture Notes in Computer Science 1302, pp. 157-171. Springer-Verlag.
29. Sterling, L. and Shapiro, E. (1986) The Art of Prolog. MIT Press.
30. Verbaeten, S., Sagonas, K. F. and De Schreye, D. (1999) Modular termination proofs for Prolog with tabling. In: G. Nadathur (ed.), Proceedings of International Conference on Principles and Practice of Declarative Programming (PPDP'99): Lecture Notes in Computer Science 1702, pp. 342-359. Springer-Verlag.
31. Verbaeten, S., Sagonas, K. F. and De Schreye, D. (2001) Termination proofs for logic programs with tabling. ACM Trans. Computational Logic, 2(1), 57-92.