Modular termination proofs for prolog with tabling

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

Volumn 1702, Issue , 1999, Pages 342-359

  Verbaeten, Sofie ^a   Sagonas, Konstantinos ^b   De Schreye, Danny ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

LOGIC PROGRAMS; SELECTION RULES; SLD RESOLUTION; TABLED EXECUTION; TERMINATION CONDITION; TERMINATION PROOF; TWO WAYS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84979085292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10704567_21     Document Type: Conference Paper

References (19)

1. K. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of theoretical computer science, Vol. B. Elsevier Science Publishers, 1990. 345.
2. K. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. In Information and Computation, 106(1): 109-157, 1993. 346.
3. K. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory, pages 183-229. 1994. 343.
4. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. J. ACM, 43(1): 20-74, 1996. 342, 342, 346.
5. D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. Journal of Logic Programming, 19 & 20: 199-260, 1994. 342, 349, 357.
6. D. De Schreye, K. Verschaetse, and M. Bruynooghe. A framework for analysing the termination of definite logic programs with respect to call patterns. In Proc. FGCS'92, pages 481-488, ICOT Tokyo, 1992. ICOT. 349.
7. S. Decorte, D. De Schreye and H. Vandecasteele. Constraint-based automatic termination analysis for logic programs. ACM TOPLAS. To appear. 358.
8. S. Decorte, D. De Schreye, M. Leuschel, B. Martens, and K. Sagonas. Termination Analysis for Tabled Logic Programming. In N. Fuchs, editor, Proceedings of LOP-STR'97, number 1463 in LNCS, pages 107-123. Springer, 1997. 343, 343, 343, 348, 349, 349, 350, 352, 353, 354, 354, 357, 357, 357, 357, 357, 358.
9. J. Early. An efficient context-free parsing algorithm. CACM, 13(2): 94-102, 1970. 344.
10. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modelling of the operational behaviour of logic languages. Theor. Comp. Sc., 69(3): 289-318, 1989. 345.
11. C. K. Holst. Finiteness Analysis. In J. Hughes, editor, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architec-ture (FPCA), number 523 in LNCS, pages 473-495. Springer-Verlag, 1991. 357.
12. T. Kanamori and T. Kawamura. OLDT-based abstract interpretation. Journal of Logic Programming, 15(1 & 2): 1-30, 1993. 348.
13. J. Lloyd. Foundations of logic programming. Springer-Verlag, 1987. 345, 346.
14. L. Plümer. Termination proofs for logic programs. Number 446 in LNAI. Springer-Verlag, 1990. 357.
15. H. Tamaki and T. Sato. OLD Resolution with Tabulation. In E. Y. Shapiro, editor, Proceedings ICLP'86, LNCS 225, pages 84-98. Springer Verlag, 1986. 342, 346.
16. S. Verbaeten and D. De Schreye. Termination analysis of tabled logic programs using mode and type information. Technical Report 277, Department of Computer Science, K. U. Leuven. Available at http://www. cs. kuleuven. ac. be/_so_e. 357, 357.
17. S. Verbaeten, K. Sagonas, and D. De Schreye. Modular termination proofs for Prolog with tabling. Technical Report, Department of Computer Science, K. U. Leuven, 1999. Available at http://www. cs. kuleuven. ac. be/_so_e. 343, 349, 351, 351, 352, 352, 353, 356.
18. L. Vieille. Recursive query processing: the power of logic. Theor. Comp. Sc., 69(1): 1-53, 1989. 342.
19. D. S. Warren. Notes for "Programming in Tabled Prolog." Early draft available at http://www. cs. sunysb. edu/_warren/, 1998. 344.