On proving left termination of constraint logic programs

ACM Transactions on Computational Logic

Volumn 4, Issue 2, 2003, Pages 207-259

  Mesnard, Fred ^a   Ruggieri, Salvatore ^b  

^a UNIVERSITÉ DE LA RÉUNION   (France)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Automatic termination analysis; Constraint logic programming; Left termination; Termination inference

Indexed keywords

AUTOMATIC TERMINATION ANALYSIS; LEFT TERMINATION; TERMINATION INFERENCE;

ARTIFICIAL INTELLIGENCE; AUTOMATION; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; MATHEMATICAL MODELS; THEOREM PROVING; TREES (MATHEMATICS);

LOGIC PROGRAMMING;

EID: 3042773721     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/635499.635503     Document Type: Article

References (90)

1. AGUZZI, G. AND MODIGLIANI, U. 1993. Proving termination of logic program by transforming them into equivalent term rewriting systems. In Proc. of the Conf. on Foundations of Software Technology and Theoretical Computer Science, R. K. Shyamasundar, Ed. Lecture Notes in Computer Science, vol. 761. Springer-Verlag, Berlin, 114-124.
2. AJILI, F. AND CONTEJEAN, E. 1997. Avoiding slack variables in the solving of linear diophantine equations and inequations. Theor. Comput. Sci. 173, 1, 183-208.
3. APT, K. R. 1997. From Logic Programming to Prolog. Prentice Hall, Upper Saddle River, NJ.
4. APT, K. R. AND PEDRESCHI, D. 1993. Reasoning about termination of pure Prolog programs. Inf. Comput. 106, 1, 109-157.
5. APT, K. R. AND PEDRESCHI, D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory, G. Levi, Ed. Oxford University Press, 183-229.
6. ARTS, T. 1997. Automatically proving termination and innermost normalisation of term rewriting systems. Ph.D. thesis, Universiteit Utrecht.
7. BAKER, N. AND SØNDERGAARD, H. 1993. Definiteness Analysis for CLP(ℛ). In Proc. of the Australian Computer Science Conf., G. Gupta, G. Mohay, and R. Topor, Eds. Australian Computer Science Communications, vol. 15. 321-332.
8. BAUDINET, M. 1992. Proving termination properties of Prolog programs: a semantic approach. J. Logic Prog. 14, 1 & 2, 1-29.
9. BENOY, F. AND KING, A. 1996. Inferring argument size relationships with CLP(ℛ). In Proc. of the International Workshop on Logic Programming Synthesis and Transformation, J. P. Gallagher, Ed. Lecture Notes in Computer Science, vol. 1207. Springer-Verlag, Berlin, 204-223.
10. BEZEM, M. A. 1993. Strong termination of logic programs. J. Logic Program. 15, 1 & 2, 79-97.
11. BOSSI, A., COCCO, N., ETALLE, S., AND ROSSI, S. 2002. On modular termination proofs of general logic programs. Theory Pract. Logic Prog. 2, 3, 263-291.
12. BOSSI, A., COCCO, N., AND FABRIS, M. 1994a. Norms on terms and their use in proving universal termination of a logic program. Theor. Comput. Sci. 124, 2, 297-328.
13. BOSSI, A., ETALLE, S., ROSSI, S., AND SMAUS, J.-G. 2001. Semantics and termination of simplymoded logic programs with dynamic scheduling. In Proc. of the European Symposium on Programming, D. Sands, Ed. Lecture Notes in Computer Science, vol. 2028. Springer-Verlag, Berlin, 402-416.
14. BOSSI, A., GABBRIELLI, M., LEVI, G., AND MARTELLI, M. 1994b. The S-semantics approach: Theory and applications. J. Logic Prog. 19 & 20, 149-197.
15. BRONSARD, F., LAKSHMAN, T. K., AND REDDY, U. S. 1992. A framework of directionality for proving termination of logic programs. In Proc. of the Joint International Conf. and Symposium on Logic Programming, K. R. Apt, Ed. The MIT Press, Cambridge, 321-335.
16. BUENO, F., CABEZA, D., CARRO, M., HERMENEGILDO, M., LÓPEZ- GARCÍA, P., AND PUEBLA, G. 1997. The Ciao Prolog system: Reference manual. The Ciao System Documentation Series-TR CLIP3/97.1.
17. School of Computer Science, Technical University of Madrid (UPM). System and on-line version of the manual available at http://clip.dia.fi.upm.es/ Software/Ciao/.
18. CARLSSON, M. 1994. Boolean constraints in SICStus Prolog. Tech. Rep. T91:09, Swedish Institute of Computer Science.
19. CLARK, K. L. 1978. Negation as failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, 293-322.
20. CODISH, M. 1999. Worst-case groundness analysis using positive Boolean functions. J. Logic Prog. 41, 1, 125-128.
21. CODISH, M. AND LAGOON, V. 2000. Type dependencies for logic programs using ACI-unification. Theor. Comput. SCi. 238, 1 & 2, 131-159.
22. CODISH, M. AND TABOCH, C. 1999. A semantic basis for the termination analysis of logic programs. J. Logic Prog. 41, 1, 103-123. TerminWeb can be used online at http://www.cs.bgu.ac.il/~mcodish/TerminWeb.
23. CODOGNET, P. AND FILÉ, G. 1992. Computations, abstractions and contraints in logic programming. In Proceeding of the IEEE International Conf. on Computer Languages (Oakland, Calif.). IEEE Computer Society Press, Los Alamitos, Calif.
24. COLMERAUER, A. 1982. Prolog and infinite trees. In Logic Programming, K. Clark and S. Tarnlund, Eds. Academic Press, Orlando, Fla., 231-251.
25. COLMERAUER, A. 1984. Equations and inequations on finite and infinite trees. In Proc. of the International Conf. on Fifth Generation Computer Systems (FGCS-84) (Tokyo, Japan). ICOT, Uppsala University, 85-99.
26. COLMERAUER, A. 1990. An introduction to Prolog III. Communi. ACM 33, 7, 69-90.
27. COLUSSI, L., MARCHIORI, E., AND MARCHIORI, M. 1995. On termination of constraint logic programs. In Proc. of Principles and Practice of Constraint Programming, U. Montanari and F. Rossi, Eds. Lecture Notes in Computer Science, vol. 976. Springer-Verlag, Berlin, 431-448.
28. CORSINI, M.-M. AND RAUZY, A. 1997. Toupie: the μ-calculus over finite domains as a constraint language. J. Automat. Reason 19, 2, 143-171.
29. COURCELLE, B. 1983. Fundamental properties of infinite trees. Theor. Comput. Sci. 25, 95-169.
30. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of the ACM Symposium on Principles of Programming Languages. ACM, New York, 238-252.
31. COUSOT, P. AND COUSOT, R. 1992. Abstract interpretation and application to logic programs. J. Logic Prog. 13, 2 & 3, 103-179.
32. COUSOT, P. AND HALBWACHS, N. 1978, Automatic discovery of linear restraints among variables of a program. In Proc. of the ACM Symposium on Principles of Programming Languages. ACM, New York, 84-96.
33. DE SCHREYE, D. AND DECORTE, S. 1994. Termination of logic programs: the never-ending story. J. Logic Prog. 19-20, 199-260.
34. 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 Conf. on Fifth Generation Computer Systems. Institute for New Generation Computer Technology, 481-488.
35. DEBRAY, S., LÓPEZ-GARCÍA, P., HERMENEGILDO, M., AND LIN, N.-W. 1994. Estimating the computational cost of logic programs. In Proc. of Static Analysis Symposium, B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 255-265.
36. DEBRAY, S. K. AND LIN, N.-W. 1993. Cost analysis of logic programs. ACM Trans. Program. Lang. Syst. 15, 5, 826-875.
37. DECORTE, S. AND DE SCHREYE, D. 1997. Demand-driven and constraint-based automatic left-termination analysis for logic programs. In Proc. of the International Conf. on Logic Programming, L. Naish, Ed. The MIT Press, 78-92.
38. DECORTE, S. AND DE SCHREYE, D. 1998. Termination analysis: some practical properties of the norm and the level mapping space. In Proc. of the 1998 Joint Int. Conf. and Symposium on Logic Programming, J. Jaffar, Ed. The MIT Press, Manchester, 235-249.
39. DECORTE, S., DE SCHREYE, D., AND VANDECASTEELE, H. 1999. Constraint-based termination analysis of logic programs. ACM Trans. Prog. Lang. Syst. 21, 6, 1137-1195.
40. DEMOEN, B., DE LA BANDA, M. G., HARVEY, W., MARRIOTT, K., AND STUCKEY, P. 1999. An overview of HAL. In Proc. of Principles and Practice of Constraint Programming, J. Jaffar, Ed. Lecture Notes in Computer Science, vol. 1713. Springer-Verlag, Berlin, 174-188.
41. DERANSART, P. AND MAŁUSZYŃSKI, J. 1993. A Grammatical View of Logic Programming. The MIT Press, Cambridge.
42. DERSHOWITZ, N. 1987. Termination of rewriting. J. Symb. Comp. 3, 1 & 2, 69-116.
43. DERSHOWITZ, N., LINDENSTRAUSS, N., SAGIV, Y., AND SEREBRENIK, A. 2001. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing 12, 1/2, 117-156.
44. DIAZ, D. AND CODOGNET, P. 2001. Design and Implementation of the GNU Prolog system. Journal of Functional and Logic Programming 2001, 6-10 (October). System and on-line version of the manual available at http://pauillac.inria.fr/ ~diaz/gnu-prolog/.
45. ETALLE, S., BOSSI, A., AND COCCO, N. 1999. Termination of well-moded programs. J. Logic Prog. 38, 2, 243-257.
46. FLOYD, R. 1967. Assigning meanings to programs. In Proc. of a Symposium in Applied Mathematics. Mathematical Aspects of Computer Science, vol. 19. American Mathematical Society, 19-32.
47. FRÜHWIRTH, T. 2000. Proving termination of constraint solver programs. In New Trends in Constraints, K. R. Apt et al., Ed. Lecture Notes in Computer Science, vol. 1865. Springer-Verlag, Berlin, 298-317.
48. GABBRIELLI, M. AND LEVI, G. 1991. Modelling answer constraints in constraint logic programs. In Proc. of the International Conf. on Logic Programming, K. Furukawa, Ed. The MIT Press, Cambridge, 238-252.
49. GENAIM, S. AND CODISH, M. 2001. Inferring termination condition for logic programs using backwards analysis. In Proc. of Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science, vol. 2250. Springer-Verlag, Berlin, 685-694.
50. GIACOBAZZI, R., DEBRAY, S., AND LEVI, G. 1995. A generalized semantics for constraint logic programs. J. Logic Prog. 25, 3, 191-247.
51. GORI, R. 2000. An abstract interpretation approach to termination of logic programs. In Logic for Programming and Automated Reasonning, M. Parigot and A. Voronkov, Eds. Lecture Notes in Computer Science, vol. 1955. Springer-Verlag, Berlin, 362-380.
52. HANDJIEVA, M. 1996. STAN: A static analyzer for CLP(ℛ) based on abstract interpretation. In Proc. of Static Analysis Symposium, R. Cousot and D. A. Schmidt, Eds. Lecture Notes in Computer Science, vol. 1145. Springer-Verlag, Berlin, 383-384.
53. HANUS, M. 1993. Analysis of nonlinear constraints in CLP(R). In Proc. of the International Conf. on Logic Programming, D. S. Warren, Ed. The MIT Press, Cambridge, 83-99.
54. HONG, H. 1993. RISC-CLP(Real): Logic programming with non-linear constraints over the reals. In Constraint Logic Programming: Selected Research, F. Benhamou and A. Colmerauer, Eds. The MIT Press, Cambridge, 133-159.
55. HOWE, J. AND KING, A. 2000. Abstracting numeric constraints with Boolean functions. Inf. Process. Lett. 75, 1-2, 17-23.
56. JAFFAR, J. AND LASSEZ, J. L. 1987. Constraint logic programming. In Proc. of the ACM Symposium on Principles of Programming Languages. ACM, New York, 111-119.
57. JAFFAR, J. AND MAHER, M. J. 1994. Constraint logic programming: A survey. J. Logic Program. 19 & 20, 503-581.
58. JAFFAR, J., MAHER, M. J., MARRIOTT, K., AND STUCKEY, P. J. 1998. The semantics of constraint logic programs. J. Logic Prog. 37, 1-3, 1-46.
59. JAFFAR, J., MICHAYLOV, S., STUCKEY, P., AND YAP, R. 1992. The CLP(R) language and system. ACM Trans. Program. Lang. Syst. 14, 3, 339-395.
60. KING, A. AND LIU, L. 2002. A backward analysis for constraint logic programs. Theory Pract. Logic Prog., 2, 4-5, 517-547.
61. KRISHNA RAO, M. R. K., KAPUR, D., AND SHYAMASUNDAR, R. K. 1998. Transformational methodology for proving termination of logic programs. J. Logic Prog. 34, 1, 1-41.
62. LINDENSTRAUSS, N. 1997. TermiLog: A system for checking termination of queries to logic programs. http://www.cs.huji.ac.il/~naomil.
63. LINDENSTRAUSS, N. AND SAGIV, Y. 1997. Automatic termination analysis of logic programs. In Proc. of the International Conf. on Logic Programming, L. Naish, Ed. The MIT Press, Cambridge, 63-77.
64. LINDENSTHAUSS, N., SAGIV, Y., AND SEREBRENIK, A. 1997. Unfolding the mystery of mergesort. In Proc. of the International Workshop on Logic Programming Synthesis and Transformation, N. E. Fucks, Ed. Lecture Notes in Computer Science, vol. 1463. Springer-Verlag, Berlin, 206-225.
65. MARCHIORI, E. 1996. Proving termination of general logic programs. J. Artifi. Intel. Res. 4, 179-208.
66. MARCHIORI, E. AND TEUSINK, F. 1999. On termination of logic programs with delay declarations. J. Logic Prog. 39, 1-3, 95-124.
67. MARCHIORI, M. 1994. Logic programs as term rewriting systems. In Proc. of the International Conf. on Algebraic and Logic Programming, G. Levi and M. Rodríguez-Artalejo, Eds. Lecture Notes in Computer Science, vol. 850. Springer-Verlag, Berlin, 223-241.
68. MARRIOTT, K. AND STUCKEY, P. J. 1998. Programming with Constraints: An Introduction. The MIT Press, Cambridge.
69. MARTIN, J. AND KINO, A. 1997. Generating efficient, terminating logic programs. In Proc. of the International Conf. on Theory and Practice of Software Development, M. Bidoit and M. Dauchet, Eds. Lecture Notes in Computer Science, vol. 1214. Springer-Verlag, Berlin, 273-284.
70. MESNARD, F. 1996. Inferring left-terminating classes of queries for constraint logic programs. In Proc. of the Joint International Conf. and Symposium on Logic Programming, M. J. Maher, Ed. The MIT Press, Cambridge, 7-21.
71. MESNARD, F., HOARAU, S., AND MAILLARD, A. 1998. CLP(χX) for automatically proving program properties. J. Logic Prog. 37, 1-3, 77-93.
72. MESNARD, F. AND NEUMERKEL, U. 2000. cTI: a tool for inferring termination conditions for ISO-Prolog.http://www.complang.tuwien.ac.at/cti.
73. MESNARD, F. AND NEUMERKEL, U. 2001. Applying static analysis techniques for inferring termination conditions of logic programs. In Static Analysis Symposium, P. Cousot, Ed. Lecture Notes in Computer Science, vol. 2126. Springer-Verlag, Berlin, 93-110.
74. PARK, D. 1970. Fixpoint induction and proofs of program properties. Mach. Intel. 5, 59-78.
75. PEDRESCHI, D. AND RUGGIERI, S. 1999. Bounded nondeterminism of logic programs. In Proc. of the International Conf. on Logic Programming, D. De Schreye, Ed. The MIT Press, Cambridge, 350-364.
76. PEDRESCHI, D., RUGGIERI, S., AND SMAUS, J.-G. 2002. Classes of terminating logic programs. Theory Prac. Logic Prog. 2, 3, 369-418.
77. REDDY, U. 1986. On the relation between logic and functional languages. In Logic Programming: Functions, Relations, and Equations, D. DeGroot and G. Lindstrom, Eds. Prentice Hall, Upper Saddle River, NJ, 3-36.
78. lin) revised. In Proc. of the Joint International Conf. and Symposium on Logic Programming, M. J. Maher, Ed. The MIT Press, Cambridge, 22-36.
79. RUGGIERI, S. 1997. Termination of constraint logic programs. In Proc. of the International Colloquium on Automata, Languages and Programming, P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds. Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, Berlin, 838-848.
80. RUGGIERI, S. 2001. ∃-universal termination of logic programs. Theor. Comput. Sci. 254, 1 & 2, 273-296.
81. SAGIV, Y. 1991. A termination test for logic programs. In Proc. of the International Logic Programming Symposium, V. A. Saraswat and K. Ueda, Eds. The MIT Press, Cambridge, 518-532.
82. SCHRIJVER, A. 1986. Theory of Linear and Integer Programming. Wiley, New York.
83. SEREBRENIK, A. AND DE SCHREYE, D. 2001. Non-tranformational termination analysis of logic programs, based on general term-orderings. In Proc. of the International Workshop on Logic Programming Synthesis and Transformation, K.-K. Lau, Ed. Lecture Notes in Computer Science, vol. 2042. Springer-Verlag, Berlin, 69-85.
84. SHOENFIELD, J. 1967. Mathematical Logic. Addison-Wesdley, Reading, Mass.
85. SMAUS, J.-G. 1999. Proving termination of input-consuming logic programs. In Proc. of the International Conf. on Logic Programming, D. De Schreye, Ed. The MIT Press, Cambridge, 335-349.
86. SOHN, K. AND VAN GELDER, A. 1991. Termination detection in logic programs using argument sizes. In Proc. of the ACM Symposium on Principles of Database Systems. ACM, New York, 216-226.
87. SPEIRS, C., SOMOGYI, Z., AND SØNDERGAARD, H. 1997. Termination analysis for Mercury. In Proc. of the International Static Analysis Symposium, P. Van Hentenryck, Ed. Lecture Notes in Computer Science, vol. 1302. Springer-Verlag, Berlin, 160-171.
88. STARK, R. F. 1998. The theoretical foundations of LPTP (A logic program theorem prover). J. Logic Prog. 36, 3, 241-269.
89. STUCKEY, P. J. 1995. Negation and constraint logic programming. Inf. Comput. 118, 1, 12-33.
90. VAN HENTENRYCK, P. 1989. Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge.