Termination of well-moded programs

Journal of Logic Programming

Volumn 38, Issue 2, 1999, Pages 243-257

  Etalle, S ^a   Bossi, A ^b   Cocco, N ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Modular proofs; Termination; Well moded programs

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; PROLOG (PROGRAMMING LANGUAGE);

MODULAR PROOFS; WELL-MODED PROGRAMS;

LOGIC PROGRAMMING;

EID: 0033078655     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10025-0     Document Type: Article

References (28)

1. K.R. Apt, From Logic Programming to Prolog, Prentice-Hall, Englewood Cliffs, NJ, 1997.
2. K.R. Apt, M. Bezem, Acyclic programs, New Generation Computing 29 (3) (1991) 335-363.
3. K.R. Apt, S. Etalle, On the unification free Prolog programs, in: A. Borzyszkowski, S. Sokolowski (Eds.), Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS 93), Lecture Notes in Computer Science, Springer, Berlin, 1993, pp. 1-19.
4. K.R. Apt, I. Luitjes, Verification of logic programs with delay declarations, in: A. Borzyszkowski, S. Sokolowski (Eds.) Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology (AMAST'95), Lecture Notes in Computer Science, Springer, Berlin, 1995.
5. K.R. Apt, E. Marchiori, Reasoning about Prolog programs: from modes through types to assertions, Formal Aspects of Computing 6 (6A) (1994) 743-765.
6. K.R. Apt, D. Pedreschi, Studies in pure Prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Symposium in Computational Logic, Springer, Berlin, 1990 pp. 150-176.
7. K.R. Apt, D. Pedreschi, Proving termination of general Prolog programs, in: T. Ito, A. Meyer (Eds.), Proceedings of the International Conference on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science 526, Springer, Berlin, 1991, pp. 265-289.
8. K.R. Apt, D. Pedreschi, Modular termination proofs for logic and pure Prolog programs, in: G. Levi (Ed.), Advances in Logic Programming Theory, Oxford University Press, Oxford, 1994, pp. 183-229.
9. K.R. Apt, A. Pellegrini, On the occur-check free Prolog programs, ACM Toplas 16 (3) (1994) 687-726.
10. M. Bezem, Characterizing termination of logic programs, in: E.L. Lusk, L.A. Overbeek (Eds.), Proceedings of NACLP'89, MIT Press, Cambridge, 1989, pp. 69-80.
11. M. Bezem, Strong termination of logic programs, Journal of Logic Programming 15 (1,2) (1993) 79-97.
12. A. Bossi, N. Cocco, M. Fabris, Proving termination of logic programs by exploiting term properties, in: S. Abramsky, T.S.E. Maibaum (Eds.), Proceedings of CCPSD-TAPSOFT'91, Lecture Notes in Computer Science, vol. 494, 1991, pp. 153-180.
13. A. Bossi, N. Cocco, M. Fabris, Norms on terms and their use in proving universal termination of a logic program, Theoretical Computer Science 124 (1994) 297-328.
14. L. Cavedon, Continuity, consistency and completeness properties for logic programs, in: G. Levi, M. Martelli (Eds.), 6 International Conference on Logic Programming, MIT Press, Cambridge, 1989, pp. 571-584.
15. K. Verschaetse, D. De Schreye, M. Bruynooghe. A framework for analyzing the termination of definite logic programs with respect to call patterns, in: Proceedings of FGCS'92, ICOT, 1992, pp. 481-488.
16. S. Decorte, Enhancing the power of termination analysis of logic programs through types and constraints, Ph.D. thesis, Department of Computer Science, K.U. Leuven, 1997.
17. S. Decorte, D. De Schreye, M. Fabris, Automatic inference of norms: a missing link in automatic termination analysis, in: D. Miller (Ed.), Proceedings of ILPS'93, MIT Press, Cambridge, 1993.
18. P. Dembinski, J. Maluszynski, AND-parallelism with intelligent backtracking for annotated logic programs, in: Proceedings of the International Symposium on Logic Programming, Boston, 1985, pp. 29-38.
19. C.S. Mellish, The Automatic Generation of Mode Declarations for Prolog Programs, DAI Research Paper 163, Department of Artificial Intelligence, University of Edinburgh, 1981.
20. L. Pluemer, Termination proofs for logic programs, Lectures Notes in Artificial Intelligence, vol. 446, Springer, Berlin, 1990.
21. L. Pluemer, Termination proofs for Prolog programs operating on nonground terms, in: Proceedings of ILPS'91, MIT Press, Cambridge, 1991, pp. 503-517.
22. D. Rosenblueth, Chart parsers as proof procedures for fixed-mode logic programs, in: Proceedings of the International Conference on Fifth Generation Computer Systems, ACM, ICOT, Japan, 1992, pp. 1125-1132.
23. D. De Schreye, S. Decorte, Termination of logic programs: the never-ending story, Journal of Logic Programming 19-20 (1994) 199-260.
24. D. De Schreye, K. Verschaetse, Deriving linear size relations for Logic Programs by abstract interpretation, New Generation Computing 13 (2) (1995) 117-154.
25. Z. Somogyi, F. Henderson, T. Conway, Mercury: an efficient purely declarative logic programming language, in: Australian Computer Science Conference, 1995 (available at http://www.cs.mu.oz.au/ mercury/papers.html).
26. C. Speirs, Z. Somogyi, H. Sondergaard, Termination analysis for Mercury, in: Proceedings SAS'97, Lecture Notes in Computer Science, vol. 1302, Springer, Berlin, 1997, pp. 157-171.
27. K. Verschaetse, Static termination analysis for definite Horn clause programs, Ph.D. thesis, Department of Computer Science, K.U. Leuven, 1992.
28. K. Verschaetse, D. De Schreye, Deriving termination proofs for logic programs, using abstract procedures, in: Proceedings of Eighth International Conference on Logic Programming, 1991, pp. 301-315.