Non-termination inference for constraint logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3148, Issue , 2004, Pages 377-392

  Payet, Etienne ^a   Mesnard, Fred ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; PROLOG (PROGRAMMING LANGUAGE); RECONFIGURABLE HARDWARE; STATIC ANALYSIS;

A-PROLOG; CONSTRAINT LOGIC PROGRAMS; DUAL PROBLEM; GENERAL CONSTRAINTS; INTENSIVE RESEARCH; NON TERMINATIONS; SELECTION RULES; SYNTACTIC CRITERIA;

LOGIC PROGRAMMING;

EID: 34548093889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_27     Document Type: Article

References (16)

1. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293-322. Plenum Press, New York, 1978.
2. M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. Journal of Logic Programming, 41(1):103-123, 1999.
3. D. De Schreye, M. Bruynooghe, and K. Verschaetse. On the existence of non-terminating queries for a restricted class of Prolog-clauses. Artificial Intelligence, 41:237-248, 1989.
4. D. De Schreye and S. Decorte. Termination of logic programs : the never-ending story. Journal of Logic Programming, 19-20:199-260, 1994.
5. D. De Schreye, K. Verschaetse, and M. Bruynooghe. A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs. In Proc. of ICLP'90, pages 649-663. The MIT Press, 1990.
6. M. Gabbrielli and R. Giacobazzi. Goal independency and call patterns in the analysis of logic programs. In Proceedings of the ACM Symposium on applied computing, pages 394-399. ACM Press, 1994.
7. S. Genaim and M. Codish. 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, 2001.
8. J. Jaffar and J. L. Lassez. Constraint logic programming. In Proc. of the ACM Symposium on Principles of Programming Languages, pages 111-119. ACM Press, 1987.
9. J. Jaffar, M. J. Maher, K. Marriott, and P. J. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(1-3):1-46, 1998.
10. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
11. F. Mesnard. Inferring left-terminating classes of queries for constraint logic programs by means of approximations. In M. J. Maher, editor, Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming, pages 7-21. MIT Press, 1996.
12. F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In P. Cousot, editor, Static Analysis Symposium, volume 2126 of Lecture Notes in Computer Science, pages 93-110. Springer-Verlag, Berlin, 2001.
13. F. Mesnard, E. Payet, and U. Neumerkel. Detecting optimal termination conditions of logic programs. In M. Hermenegildo and G. Puebla, editors, Proc. of the 9th International Symposium on Static Analysis, volume 2477 of Lecture Notes in Computer Science, pages 509-525. Springer-Verlag, Berlin, 2002.
14. F. Mesnard and S. Ruggieri. On proving left termination of constraint logic programs. ACM Transactions on Computational Logic, pages 207-259, 2003.
15. lin) revised. In M. Maher, editor, Proc. of the Joint International Conf. and Symposium on Logic Programming, pages 22-36. The MIT Press, 1996.
16. J. Shoenfield. Mathematical Logic. Addison Wesley, Reading, 1967.