Nontermination inference of logic programs

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 2, 2006, Pages 256-289

  Payet, Etienne ^a   Mesnard, Fred ^a  

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

Author keywords

Logic programming; Nontermination analysis; Optimal termination condition; Static analysis

Indexed keywords

ALGORITHMS; AUTOMATION; INFERENCE ENGINES; QUERY LANGUAGES; STATISTICAL METHODS;

NONTERMINATION ANALYSIS; OPTIMAL TERMINATION CONDITION; STATIC ANALYSIS;

LOGIC PROGRAMMING;

EID: 33745414500     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1119479.1119481     Document Type: Article

References (36)

1. APT, K. R. 1997. From Logic Programming to Prolog. Prentice Hall.
2. 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.
3. ARTS, T. AND ZANTEMA, H. 1996. Termination of logic programs using semantic unification. In Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, vol. 1048. Springer-Verlag, Berlin. TALP can be used online at http://bibiserv.tachfak.uni.biekafeld.de/talp/.
4. BOL, R. N. 1993. Loop checking in partial deduction. J. Logic Prog. 16, 25-46.
5. BOL, R. N., APT, K. R., AND KLOP, J. W. 1991. An analysis of loop checking mechanisms for logic programs. Theor. Comput. Sci. 86, 35-79.
6. CLARK, K. L. 1979. Predicate logic as a computational formalism. Tech. Rep. Doc 79/59, Logic Programming Group, Imperial College, London.
7. CODISH, M. AND TABOCH, C. 1999. A semantic basis for the termination analysis of logic programs. J. Logic Prog. 41, 1, 103-123.
8. DE SCHREYE, D., BRUYNOOGHE, M., AND VERSCHAETSE, K. 1989. On the existence of nonterminating queries for a restricted class of Prolog-clauses. Artificial Intelligence 41, 237-248.
9. DE SCHREYE, D. AND DECORTE, S. 1994. Termination of logic programs: the never-ending story. J. Logic Prog. 19-20, 199-260.
10. DE SCHREYE, D., VERSCHAETSE, K., AND BRUYNOOGHE, M. 1990. A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs. In Proceedings of ICLP'90. The MIT Press, 649-663.
11. DERANSART, P. AND FERRAND, G. 1987. Programmation en logique avec négation: Présentation formelle. Tech. Rep. 87/3, Laboratoire d'Informatique, Département de Mathématiques et d'Informatique, Université d'Orleans.
12. 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.
13. DEVIENNE, P. 1988. Weighted graphs, a tool for expressing the behavious of recursive rules in logic programming. I. for New Generation Computer Technology (ICOT), Ed. OHMSHA Ltd. Tokyo and Springer-Verlag, 397-404. Proceedings of the International Conference on Fifth Generation Computer Systems 88, Tokyo, Japan.
14. DEVIENNE, P. 1990. Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming. Theor. Comput. Sci. 75, 2, 157-215.
15. DEVIENNE, P., LEBÈGUE, P., AND ROUTIER, J.-C. 1993. Halting problem of one binary Horn clause is undecidable. In LNCS. Vol. 665. Springer-Verlag, 48-57. Proceedings of STACS'93.
16. GABBRIELLI, M. AND GIACOBAZZI, R. 1994. Goal independency and call patterns in the analysis of logic programs. In Proceedings of the ACM Symposium on Applied Computing. ACM Press, 394-399.
17. GENAIM, S. AND CODISH, M. 2001. Inferring termination condition for logic programs using backwards analysis. In Proceedings of Logic for Programming, Artificial intelligence and Reasoning. Lecture Notes in Computer Science. Springer-Verlag, Berlin. Termin Web can be used online from http://www.cs.bgu. ac.il/~codish.
18. GORI, R. AND LEVI, G. 1997. Finite failure is and-compositional. J. Logic Comput. 7, 6, 753-776.
19. JAFFAR, J. AND LASSEZ, J. L. 1987. Constraint logic programming. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM Press, 111-119.
20. LINDENSTRAUSS, N. 1997. TermiLog: a system for checking termination of queries to logic programs, http://www.cs.huji.ac.il/~naomil.
21. LLOYD, J. W. 1987. Foundations of Logic Programming. Springer-Verlag.
22. FALASCHI, M., LEVI, G., MARTELLI, M., AND PALAMIDESSI, C. 1993. A model-theoretic reconstruction of the operational semantics of logic programs. Information and Computation 102, 1, 86-113.
23. MESNARD, F. 1996. Inferring left-terminating classes of queries for constraint logic programs by means of approximations. In Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, M. J. Maher, Ed. MIT Press, 7-21.
24. MESNARD, F. AND BAGNARA, R. 2004. cTI: a constraint-based termination inference tool for ISO-Prolog. Theory and Practice of Logic Programming. To appear.
25. MESNARD, F. AND NEUMERKEL, U. 2000. cTI: a tool for inferring termination conditions of ISO-Prolog, http://WBB.univ-reunion.fr/~gcc.
26. 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.
27. MESNARD, F., PAYET, E., AND NEUMERKEL, U. 2002. Detecting optimal termination conditions of logic programs. In Proceedings of the 9th International Symposium on Static Analysis, M. Hermenegildo and G. Puebla, Eds. Lecture Notes in Computer Science, vol. 2477. Springer-Verlag, Berlin, 509-525.
28. O'KEEFE, R. 1990. The Craft of Prolog. MIT Press.
29. PAYET, E. AND MESNARD, F. 2004. nontermination inference of logic programs. In Proceedings of the 11th International Symposium on Static Analysis, R. Giacobazzi, Ed. Lecture Notes in Computer Science, vol. 3148. Springer-Verlag, Berlin.
30. PLÜMER, L. 1990. Terminations proofs for logic programs. Number 446 in LNAI. Springer-Verlag, Berlin.
31. SAHLIN, D. 1990. The mixtus approach to automatic partial evaluation of full Prolog. In Proceedings of the 1990 North American Conference on Logic Programming, S. Debray and M. Hermenegildo, Eds. MIT Press, Cambridge, MA, 377-398.
32. SAHLIN, D. 1993. Mixtus: an automatic partial evaluator for full Prolog. New Generation Computing 12, 1, 7-51.
33. SCHMIDT-SCHAUSS, M. 1988. Implication of clauses is undecidable. Theoretical Computer Science 59, 287-296.
34. SHEN, Y.-D. 1997. An extended variant of atoms loop check for positive logic programs. New Generation Computing 15, 2, 187-204.
35. SHEN, Y.-D., YOU, J.-H., YUAN, L.-Y., SHEN, S., AND YANG, Q. 2003. A dynamic approach to characterizing termination of general logic programs. ACM Trans. Comput. Logic 4, 4, 417-434.
36. SHEN, Y.-D., YUAN, L.-Y, AND YOU, J.-H. 2001. Loops checks for logic programs with functions. Theoretical Computer Science 266, 1-2, 441-461.