A Dynamic Approach to Characterizing Termination of General Logic Programs

ACM Transactions on Computational Logic

Volumn 4, Issue 4, 2003, Pages 417-430

  Shen, Yi Dong ^a   You, Jia Huai ^b   Yuan, Li Yan ^b   Shen, Samuel S P ^b   Yang, Qiang ^c  

^a INSTITUTE OF SOFTWARE   (China)

^b UNIVERSITY OF ALBERTA   (Canada)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

dynamic characterization; Languages; Prolog; Termination analysis; Theory

Indexed keywords

DYNAMIC CHARACTERIZATION; PROLOG; SUBGOALS; TERMINATION ANALYSIS;

AUTOMATIC PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; FORMAL LOGIC; INFORMATION ANALYSIS; MAPPING; PROGRAMMING THEORY; TREES (MATHEMATICS);

LOGIC PROGRAMMING;

EID: 3042856060     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/937555.937556     Document Type: Article

References (30)

1. Apt, K. R. and Doets, K. 1994. Anew definition of sldnf-resolution. J. Logic Program. 18,177-190.
2. Apt, K. R. and Pedreschi, D. 1993. Reasoning about termination of pure prolog programs. Information and Computation 106, 109-157.
3. Bezem, M. 1992. Characterizing termination of logic programs with level mapping. J. Logic Program. 15, 1/2, 79-98.
4. Bol, R. N. 1991. Loop checking in logic programming. Ph.D. thesis, The University of Amsterdam, Amsterdam.
5. Bol, R. N., Apt, K. R., and Klop, J. W. 1991. An analysis of loop checking mechanisms for logic programs. Theoretical Computer Science 86, 1, 35-79.
6. Bossi, A., Cocco, N., and Fabris, M. 1994. Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science 124, 1, 297-328.
7. Brodsky, A. and Sagiv, Y. 1991. Inference of inequality constraints in logic programs. In Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, Denver, 227-240.
8. Chan, D. 1988. Constructive negation based on the completed database. In Proceedings of the Fifth International Conference and Symposium on Logic Programming. MIT Press, Seattle, 111-125.
9. Chen, W. D. and Warren, D. S. 1996. Tabled evaluation with delaying for general logic programs. J. ACM 43, 1, 20-74.
10. Clark, K. L. 1978. Negation as failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum, New York, 293-322.
11. Decorte, S., Schreye, D. D., and Fabris, M. 1993. Automatic inference of norms: A missing link in automatic termination analysis. In Proceedings of the 1993 International Symposium on Logic Programming. MIT Press, Vancouver, Canada, 420-436.
12. Decorte, S., Schreye, D. D., and Vandecasteele, H. 1999. Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst. 21, 6, 1137-1195.
13. Dershowitz, N. 1987. Termination of rewriting. J. Symb. Computation 3, 69-116.
14. Higman, G. 1952. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society 3, 2, 326-336.
15. Islab. 1998. SICStus Prolog User's Manual. Intelligent Systems Laboratory, Swedish Institute of Computer Science.
16. Kunen, K. 1989. Signed data dependencies in logic programming. J. Logic Program. 7, 231-246.
17. Lindenstrauss, N. and Sagiv, Y. 1997. Automatic termination analysis of logic programs. In Proceedings of the Fourteenth International Conference on Logic Programming. MIT Press, Leuven, Belgium, 63-77.
18. Lloyd, J. W. 1987. Foundations of Logic Programming. Springer-Verlag, Berlin.
19. Martelli, M. and Tricomi, C. 1992. Anew sldnf-tree. Information Processing Letters 43, 2, 57-62.
20. Martin, J. C., King, A., and Soper, P. 1997. Typed norms for typed logic programs. In Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation. Springer, Stockholm, Sweden, 224-238.
21. Plumer, L. 1990a. Termination Proofs for Logic Programs. Lecture Notes in Computer Science 446, Springer-Verlag, Berlin.
22. Plumer, L. 1990b. Termination proofs for logic programs based on predicate inequalities. In Proceedings of the Seventh International Conference on Logic Programming. MIT Press, Cambridge, MA, 634-648.
23. Schreye, D. D. and Decorte, S. 1993. Termination of logic programs: the never-ending story. J Logic Program. 19, 20, 199-260.
24. Schreye, D. D. and Verschaetse, K. 1995. Deriving linear size relations for logic programs by abstract interpretation. New Generation Computing 13, 2, 117-154.
25. Schreye, D. D., Verschaetse, K., and Bruynooghe, M. 1992. A framework for analyzingthe termination of definite logic programs with respect to call patterns. In Proceedings of the International Conference on Fifth Generation Computer Systems. IOS Press, Tokyo, Japan, 481-488.
26. Shen, Y. D., Yuan, L. Y., and You, J. H. 2001. Loop checks for logic programs with functions. Theoretical Computer Science 266, 1/2, 441-461.
27. Shen, Y. D., Yuan, L. Y., and You, J. H. 2002. Slt-resolution for the well-founded semantics. J Autom. Reason. 28, 1, 53-97.
28. Ullman, J. D. and Gelder, A. V. 1988. Efficient tests for top-down termination of logical rules. J. ACM 35, 2, 345-373.
29. Verbaeten, S., Schreye, D. D., and Sagonas, K. 2001. Termination proofs for logic programs with tabling. ACM Trans. Computational Logic 2, 1, 57-92.
30. Verschaetse, K. 1992. Static termination analysis for definite horn clause programs. Ph.D. thesis, Department of Computer Science, K. U. Leuven.