Classes of terminating logic programs

Theory and Practice of Logic Programming

Volumn 2, Issue 3, 2002, Pages 369-418

  Pedreschi, Dino ^a   Ruggieri, Salvatore ^a   Smaus, Jan Georg ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Control; Dynamic scheduling; Left termination; Level mapping; Logic program; Norm; Selection rule; Universal termination

Indexed keywords

EID: 0042355319     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068402001400     Document Type: Article

References (77)

1. Aguzzi, G. and Modigliani, U. (1993) Proving termination of logic program by transforming them into equivalent term rewriting systems. In: Shyamasundar, R. K. (ed.), Proc. of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science: Lecture Notes in Computer Science 761, pp. 114-124. Springer-Verlag.
2. Apt, K. R. (1997) From logic programming to Prolog. Prentice Hall.
3. Apt, K. R. and Bezem, M. (1991) Acyclic programs. New Generation Computing, 29(3), 335-363.
4. Apt, K. R. and Etalle, S. (1993) On the unification free Prolog programs. In: Borzyszkowski, A. and Sokolowski, S. (eds.), Proc. of the 18th International Symposium on Mathematical Foundations of Computer Science: Lecture Notes in Computer Science 711, pp. 1-19. Springer-Verlag.
5. Apt, K. R. and Luitjes, I. (1995) Verification of logic programs with delay declarations. In: Alagar, V. S. and Nivat, M. (eds.), Proc. of the 4th International Conference on Algebraic Methodology and Software Technology: Lecture Notes in Computer Science 936, pp. 66-90. Springer-Verlag.
6. Apt, K. R. and Pedreschi, D. (1993) Reasoning about termination of pure Prolog programs. Information and Computation, 106(1), 109-157.
7. Apt, K. R. and Pedreschi, D. (1994). Modular termination proofs for logic and pure Prolog programs. In: Levi, G. (ed.), Advances in Logic Programming Theory, pp. 183-229. Oxford University Press.
8. Apt, K. R., Marchiori, E. and Palamidessi, C. (1994) A declarative approach for first-order built-in's of Prolog. Applicable Algebra in Engineering, Communication and Computation, 5(3/4), 159-191.
9. Arts, T. (1997) Automatically proving termination and innermost normalisation of term rewriting systems. PhD thesis, Universiteit Utrecht.
10. Balbiani, P. (1992) The finiteness of logic programming derivations. In: Levi, G. (ed.), Proc. of the 3rd Conference on Algebraic and Logic Programming: Lecture Notes in Computer Science 632, pp. 403-419. Springer-Verlag.
11. Baudinet, M. (1992) Proving termination properties of Prolog programs: a semantic approach. J. Logic Programming, 14, 1-29.
12. Benoy, F. and King, A. (1997) Inferring argument size relationships with CLP(R). In: Gallagher, J. P. (ed.), Proc. of the 6th International Workshop on Logic Programming Synthesis and Transformation: Lecture Notes in Computer Science 1207, pp. 204-223. Springer-Verlag.
13. Bezem, M. A. (1993) Strong termination of logic programs. J. Logic Programming, 15(1/2), 79-98.
14. Bol, R. N., Apt, K. R. and Klop, J. W. (1991) An analysis of loop checking mechanism for logic programs. Theoretical Computer Science, 86(1), 35-79.
15. Bossi, A., Cocco, N. and Fabris, M. (1994) Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science, 124(2), 297-328.
16. Bossi, A., Etalle, S. and Rossi, S. (1999) Properties of input-consuming derivations. In: Etalle, S. and Smaus, J.-G. (eds.), Proc. of the ICLP Workshop on Verification of Logic Programs: Electronic Notes in Theoretical Computer Science, 30(1).
17. Bossi, A., Etalle, S. and Rossi, S. (2000) Semantics of input-consuming logic programs. In: Lloyd, J. W. et al. (eds.), Proc. of the 1st International Conference on Computational Logic: Lecture Notes in Computer Science 1861, pp. 194-208. Springer-Verlag.
18. Bossi, A., Etalle, S., Rossi, S. and Smaus, J.-G. (2001) Semantics and termination of logic programs with dynamic scheduling. In: Sands, D. (ed.), Proc. of the 10th European Symposium on Programming: Lecture Notes in Computer Science 2028, pp. 402-416. Springer-Verlag.
19. Braem, C., Charlier, B. Le, Modart, S. and Van Hentenryck, P. (1994) Cardinality analysis of Prolog. In: Bruynooghe, M. (ed.), Proc. of the International Logic Programming Symposium, pp. 457-471. MIT Press.
20. Bronsard, F., Lakshman, T. K. and Reddy, U. S. (1992) A framework of directionality for proving termination of logic programs. In: Apt, K. R. (ed.), Proc. of the Joint International Conference and Symposium on Logic Programming, pp. 321-335. MIT Press.
21. Bruynooghe, M., Vandecasteele, H., de Waal, D. A. and Denecker, M. (1998) Detecting unsolvable queries for definite logic programs. In: Palamidessi, C. et al. (eds.), Proc. of PLILP/ALP '98: Lecture Notes in Computer Science 1490, pp. 118-133. Springer-Verlag.
22. Cavedon, L. (1989) Continuity, consistency, and completeness properties for logic programs. In: Levi, G. and Martelli, M. (eds.), Proceedings of the International Conference on Logic Programming, pp. 571-584. The MIT Press.
23. Codish, M. and Taboch, C. (1999) A semantic basis for the termination analysis of logic programs. J. Logic Programming, 41(1), 103-123.
24. Colussi, L., Marchiori, E. and Marchiori, M. (1995) On termination of constraint logic programs. In: Bruynooghe, M. and Penjam, J. (eds.), Proc. of the 1st International Conference of Principles and Practice of Constraint Programming: Lecture Notes in Computer Science 976, pp. 431-448. Springer-Verlag.
25. De Schreye, D. and Decorte, S. (1994) Termination of logic programs: the never-ending story. J. Logic Programming, 19-20, 199-260.
26. 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: Proc. of the International Conference on Fifth Generation Computer Systems, pp. 481-488. Institute for New Generation Computer Technology.
27. Debray, S. K. and Lin, N. W. (1993) Cost analysis of logic programs. ACM Trans. on Programming Languages and Systems, 15(5), 826-875.
28. Decorte, S., De Schreye, D. and Fabris, M. (1993) Automatic inference of norms: A missing link in automatic termination analysis. In: Miller, D. (ed.), Proc. of the International Logic Programming Symposium, pp. 420-436. The MIT Press.
29. Decorte, S., De Schreye, D., Leuschel, M., Martens, B. and Sagonas, K. (1998) Termination analysis for tabled logic programming. In: Fuchs, N. E. (ed.), Proc. of the 7th International Workshop on Logic Programming Synthesis and Transformation: Lecture Notes in Computer Science 1463, pp. 111-127. Springer-Verlag.
30. Decorte, S., De Schreye, D. and Vandecasteele, H. (1999) Constraint-based termination analysis of logic programs. ACM Trans. on Programming Languages and Systems, 21(6), 1137-1195.
31. Deransart, P. and Małuszyński, J. (1993) A Grammatical View of Logic Programming. The MIT Press.
32. Etalle, S., Bossi, A. and Cocco, N. (1999) Termination of well-moded programs. J. Logic Programming, 38(2), 243-257.
33. Ganzinger, H. and Waldmann, U. (1992) Termination proofs of well-moded logic programs via conditional rewrite systems. In: Rusinowitch, M. and Rémy, J. L. (eds.), Proc. of the 3rd International Workshop on Conditional Term Rewriting Systems: Lecture Notes in Computer Science 656, pp. 430-437. Springer-Verlag.
34. Gori, R. (2000) An abstract interpretation approach to termination of logic programs. In: Parigot, M. and Voronkov, A. (eds.), Proc. of the 7th International Conference on Logic for Programming and Automated Reasoning: Lecture Notes in Computer Science 1955, pp. 362-380. Springer-Verlag.
35. Hill, P. M. and Lloyd, J. W. (1994) The Gödel Programming Language. The MIT Press.
36. Hitzler, P. and Seda, A. K. (1999) Acceptable programs revisited. In: Etalle, S. and Smaus, J.-G. (eds.), Proc. of ICLP Workshop on Verification of Logic Programs: Electronic Notes in Theoretical Computer Science, 30(1).
37. Hoarau, S. and Mesnard, F. (1998) Inferring and compiling termination for constraint logic programs. In: Flener, P. (ed.), Proc. of the 8th International Workshop on Logic Programming Synthesis and Transformation: Lecture Notes in Computer Science 1559, pp. 240-254. Springer-Verlag.
38. Hoarau, S. and Mesnard, F. (2001) σ-termination: from a characterisation to an automated sufficient condition. Theory and Practice of Logic Programming. To appear.
39. Kowalski, R. A. (1979) Algorithm = Logic + Control. Comm. of the ACM, 22(7), 424-436.
40. Krishna Rao, M. R. K., Kapur, D. and Shyamasundar, R. K. (1992) A transformational methodology for proving termination of logic programs. In: Börger, E., Jäger, G., Kleine Büning, H. and Richter, M. M. (eds.), Proc. of the 5th Workshop on Computer Science Logic: Lecture Notes in Computer Science 626, pp. 213-226. Springer-Verlag.
41. Krishna Rao, M. R. K., Kapur, D. and Shyamasundar, R. K. (1997) Proving termination of GHC programs. New Generation Computing, 15(3), 293-338.
42. Krishna Rao, M. R. K., Kapur, D. and Shyamasundar, R. K. (1998) Transformational methodology for proving termination of logic programs. J. Logic Programming, 34(1), 1-41.
43. Lindenstrauss, N. and Sagiv, Y. (1997) Automatic termination analysis of logic programs. In: Naish, L. (ed.), Proc. of the International Conference on Logic Programming, pp. 63-77. The MIT Press.
44. Lüttringhaus-Kappel, S. (1993) Control generation for logic programs. In: Warren, D. S. (ed.), Proceedings of the 10th International Conference on Logic Programming, pp. 478-495. MIT Press.
45. Marchiori, E. (1996a) On termination of general logic programs w.r.t. constructive negation. J. Logic Programming, 26(1), 69-89.
46. Marchiori, E. and Teusink, F. (1999) On termination of logic programs with delay declarations. J. Logic Programming, 39(1-3), 95-124.
47. Marchiori, M. (1994) Logic programs as term rewriting systems. In: Levi, G. and Rodríguez-Artalejo, M. (eds.), Proc. of the 4th International Conference on Algebraic and Logic Programming: Lecture Notes in Computer Science 850, pp. 223-241. Springer-Verlag.
48. Marchiori, M. (1996b) Proving existential termination of normal logic programs. In: Wirsing, M. and Nivat, M. (eds.), Proc. of the 5th International Conference on Algebraic Methodology and Software Technology: Lecture Notes in Computer Science 1101, pp. 375-390. Springer-Verlag.
49. Martin, J. and King, A. (1997) Generating efficient, terminating logic programs. In: Bidoit, M. and Dauchet, M. (eds.), Proc. of the 7th International Conference on Theory and Practice of Software Development: Lecture Notes in Computer Science 1214, pp. 273-284. Springer-Verlag.
50. McPhee, R. (2000) Compositional logic programming. PhD thesis, Oxford University Computing Laboratory.
51. Mesnard, F. (1996) Inferring left-terminating classes of queries for constraint logic programs. In: Maher, M. (ed.), Proc. of the Joint International Conference and Symposium on Logic Programming, pp. 7-21. The MIT Press.
52. Mesnard, F., Neumerkel, U. and Hoarau, S. (2000) Implementing cTI : a constrained-based left-termination inference tool for LP. In: de Castro Dutra, I., Costa, V. S., Silva, F., Pontelli, E. and Carro, M. (eds.), Proc. of the CL Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, pp. 152-166.
53. Naish, L. (1992) Coroutining and the construction of terminating logic programs. Technical report 92/5, Department of Computer Science, University of Melbourne.
54. Neumerkel, U. and Mesnard, F. (1999) Localizing and explaining reasons for nonterminating logic programs with failure slices. In: Nadathur, G. (ed.), Proc. of the International Conference on Principles and Practice of Declarative Programming: Lecture Notes in Computer Science 1702, pp. 328-341. Springer-Verlag.
55. Pedreschi, D. and Ruggieri, S. (1999a) Bounded nondeterminism of logic programs. In: De Schreye, D. (ed.), Proc. of the International Conference on Logic Programming, pp. 350-364. The MIT Press.
56. Pedreschi, D. and Ruggieri, S. (1999b) On logic programs that do not fail. In: Etalle, S. and Smaus, J.-G. (eds.), Proc. of ICLP Workshop on Verification of Logic Programs: Electronic Notes in Theoretical Computer Science, 30(1).
57. Pedreschi, D. and Ruggieri, S. (1999c) Verification of Logic Programs. J. Logic Programming, 39(1-3), 125-176.
58. Plümer, L. (1990) Termination proofs for logic programs: Lecture Notes in Artificial Intelligence 446. Springer-Verlag.
59. Ruggieri, S. (1997) Termination of constraint logic programs. In: Degano, P., Gorrieri, R. and Marchetti-Spaccamela, A. (eds.), Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP '97): Lecture Notes in Computer Science 1256, pp. 838-848. Springer-Verlag.
60. Ruggieri, S. (1999) Verification and validation of logic programs. PhD thesis, Dipartimento di Informatica, Università di Pisa.
61. Ruggieri, S. (2001) ∃-universal termination of logic programs. Theoretical Computer Science, 254(1-2), 273-296.
62. Sagiv, Y. (1991) A termination test for logic programs. In: Saraswat, V. A. and Ueda, K. (eds.), Proc. of the International Logic Programming Symposium, pp. 518-532. The MIT Press.
63. Serebrenik, A. and Schreye, D. De. (2001) Non-transformational termination analysis of logic programs, based on general term-orderings. In: Lau, K. (ed.), Proc. of the 10th International Workshop on Logic Programming Synthesis and Transformation, selected papers: Lecture Notes in Computer Science 2042, pp. 69-85. Springer-Verlag.
64. SICStus (1998) SICStus Prolog user's manual. Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. http://www.sics.se/sicstus/docs/3.7.1/html/sicstus-toc.html.
65. Smaus, J.-G. (1999a) Modes and types in logic programming. PhD thesis, University of Kent at Canterbury.
66. Smaus, J.-G. (1999b) Proving termination of input-consuming logic programs. In: De Schreye, D. (ed.), Proc. of the International Conference on Logic Programming, pp. 335-349. MIT Press.
67. Smaus, J.-G., Hill, P. M. and King, A. M. (2001) Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming, 1(4), 447-486.
68. Somogyi, Z., Henderson, F. and Conway, T. (1996) The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. Logic Programming, 29(1-3), 17-64.
69. Speirs, C., Somogyi, Z. and Sondergaard, H. (1997) Termination analysis for Mercury. In: Van Hentenryck, P. (ed.), Proc. of the 4th International Static Analysis Symposium: Lecture Notes in Computer Science 1302, pp. 160-171. Springer-Verlag.
70. Stärk, R. F. (1998) The theoretical foundations of LPTP (A Logic Program Theorem Prover). J. Logic Programming, 36(3), 241-269.
71. Sterling, L. and Shapiro, E. (1986) The Art of Prolog. The MIT Press.
72. Thom, J. and Zobel, J. (1988) NU-Prolog reference manual, version 1.3. Technical report, Department of Computer Science, University of Melbourne, Australia.
73. Ueda, K. (1988) Guarded Horn Clauses, a parallel logic programming language with the concept of a guard. In: Nivat, M. and Fuchi, K. (eds.), Programming of Future Generation Computers, pp. 441-456. North Holland, Amsterdam.
74. van Gelder, A. (1991) Deriving constraints among argument sizes in logic programs. Annals of Mathematics and Artificial Intelligence, 3, 361-392.
75. Verbaeten, S. (1999) Termination analysis for abductive general logic programs. In: De Schreye, D. (ed.), Proc. of the International Conference on Logic Programming, pp. 365-379. The MIT Press.
76. Verbaeten, S. and De Schreye, D. (2001) Termination of simply-moded well-typed logic programs under a tabled execution mechanism. Applicable Algebra in Engineering, Communication and Computing, 12(1/2), 157-196.
77. Verbaeten, S., Sagonas, K. and De Schreye, D. (2001) Termination proofs for logic programs with tabling. ACM Trans. on Computational Logic, 2(1), 57-92.