Termination analysis for tabled logic programming

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

Volumn 1463, Issue , 1998, Pages 111-127

  Decorte, Stefaan ^a   De Schreye, Danny ^a   Leuschel, Michael ^a   Martens, Bern ^a   Sagonas, Konstantinos ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC;

COMPUTATION RULES; LOGIC PROGRAMS; NON-TRIVIAL; PRACTICAL METHOD; PROGRAM TRANSFORMATIONS; TERMINATION ANALYSIS;

LOGIC PROGRAMMING;

EID: 84947932058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49674-2_6     Document Type: Conference Paper

References (17)

1. K.R. Apt and D. Pedreschi. Reasoning about Termination of Pure Prolog Programs. Information and Computation, 106(1):109-157, 1993.
2. R. Bol and L. Degerstedt. The Underlying Search for Magic Templates and Tabulation. In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 793-811, Budapest, Hungary, June 1993. The MIT Press.
3. A. Bossi, N. Cocco, and M. Fabris. Norms on Terms and their use in Proving Universal Termination of a Logic Program. Theoretical Computer Science, 124(2):297-328, February 1994.
4. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20-74, January 1996.
5. D. De Schreye, S. Decorte. Termination of Logic Programs: The never-ending story. Journal of Logic Programming, 19/20:199-260, May/July 1994.
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 Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS’92), pages 481-488, ICOT Tokyo, 1992. ICOT.
7. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behaviour of Logic Languages. Theoretical Computer Science, 69(3):289-318, 1989.
8. A. J. Glenstrup and N. D. Jones. BTA algorithms to ensure Termination of offline Partial Evaluation. In Perspectives of System Informatics: Proceedings of the Andrei Ershov Second International Memorial Conference, LNCS, pages 25-28. Springer-Verlag, June 1996.
9. C. K. Holst. Finiteness Analysis. In J. Hughes, editor, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA), number 523 in LNCS, pages 473-495. Springer-Verlag, August 1991.
10. J. Jørgensen and M. Leuschel. Efficiently Generating Efficient Generating Extensions in Prolog. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, number 1110 in LNCS, pages 238-262, Schloß Dagstuhl, 1996. Springer-Verlag.
11. T. Kanamori and T. Kawamura. OLDT-based Abstract Interpretation. Journal of Logic Programming, 15(1&2):1-30, January 1993.
12. M. Leuschel, B. Martens, and K. Sagonas. Preserving Termination of Tabled Logic Programs While Unfolding. In N. Fuchs, editor, Proceedings of Logic Program Synthesis and Transformation (LOPSTR’97), Leuven, Belgium, July 1997.
13. T. Mogensen and A. Bondorf. Logimix: A self-applicable Partial Evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Proceedings of Logic Program Synthesis and Transformation (LOPSTR’92), pages 214-227. Springer-Verlag, 1992.
14. L. Plümer. Termination Proofs for Logic Programs, number 446 in LNCS. Springer-Verlag, 1990.
15. K. Sagonas, T. Swift, and D. S. Warren. XSB as an Efficient Deductive Database Engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442-453, Minneapolis, Minnesota, May 1994. ACM Press.
16. H. Tamaki and T. Sato. OLD Resolution with Tabulation. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, number 225 in LNCS, pages 84-98, London, July 1986. Springer-Verlag.
17. L. Vieille. Recursive Query Processing: The Power of Logic. Theoretical Computer Science, 69(1):1-53, 1989.