Non-transformational termination analysis of logic programs, based on general term-orderings

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

Volumn 2042 LNCS, Issue , 2001, Pages 69-85

  Serebrenik, Alexander ^a   De Schreye, Danny ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; MAPPING; SYNTHESIS (CHEMICAL);

CONSTRAINT-BASED; DEMAND-DRIVEN; LEVEL MAPPING; LOGIC PROGRAMS; NEW APPROACHES; TERM-REWRITE SYSTEMS; TERMINATION ANALYSIS; TRANSFORMATIONAL APPROACH; ACCEPTABILITY; TERM-ORDERINGS;

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

EID: 84879469606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45142-0_5     Document Type: Conference Paper

References (21)

1. K. R. Apt. From Logic Programming to Prolog. Prentice-Hall Int. Series in Computer Science. Prentice Hall, 1997. 73, 74, 75, 77, 80, 83
2. K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. M. Borzyszkowski and S. Sokolowski, editors, 18th Int. Symp. on Mathematical Foundations of Computer Science, pages 1-19. Springer Verlag, 1993. LNCS 711. 77, 79
3. K. R. Apt and D. Pedreschi. Studies in Pure Prolog: Termination. In J. W. Lloyd, editor, Proc. Esprit Symp. on Comp. Logic, pages 150-176. Springer Verlag, 1990. 71, 74, 77, 78, 79, 83
4. T. Arts. Automatically proving termination and innermost normalisation of term rewriting systems. PhD thesis, Universiteit Utrecht, 1997. 69, 80, 83
5. T. Arts and H. Zantema. Termination of logic programs using semantic unification. In M. Proietti, editor, 5th Int. Workshop on Logic Programming Synthesis and Transformation, pages 219-233. Springer Verlag, 1995. LNCS 1048. 80
6. 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. 75, 83
7. D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. J. Logic Programming, 19/20:199-260, May/July 1994. 70, 80, 83
8. D. De Schreye, K. Verschaetse, and M. Bruynooghe. A framework for analyzing the termination of definite logic programs with respect to call patterns. In I. Staff, editor, Proc. of the Int. Conf. on Fifth Generation Computer Systems., pages 481-488. IOS Press, 1992. 71, 74, 75
9. S. Decorte and D. De Schreye. Termination analysis: some practical properties of the norm and level mapping space. In J. Jaffar, editor, Proc. of the 1998 Joint Int. Conf. and Symp. on Logic Programming, pages 235-249. MIT Press, June 1998. 74, 75, 83
10. S. Decorte, D. De Schreye, and H. Vandecasteele. Constraint-based termination analysis of logic programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 21(6):1137-1195, November 1999. 70, 74, 75, 80, 83
11. N. Dershowitz. Termination. In C. Kirchner, editor, First Int. Conf. on Rewriting Techniques and Applications, pages 180-224. Springer Verlag, 1985. LNCS 202. 70, 72, 76, 82
12. N. Dershowitz and C. Hoot. Topics in termination. In C. Kirchner, editor, Rewriting Techniques and Applications, 5th Int. Conf., pages 198-212. Springer Verlag, 1993. LNCS 690. 80, 83
13. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM (CACM), 22(8):465-476, August 1979. 70, 80
14. S. Etalle, A. Bossi, and N. Cocco. Termination of well-moded programs. J. Logic Programming, 38(2):243-257, February 1999. 77, 78, 79, 83
15. J. Hsiang. Rewrite method for theorem proving in first order theory with equality. Journal of Symbolic Computation, 8:133-151, 1987. 80, 83
16. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic Programming, 13(2-3):205-258, July 1992. 75, 82
17. M. Krishna Rao, D. Kapur, and R. Shyamasundar. Transformational methodology for proving termination of logic programs. J. Logic Programming, 34:1-41, 1998. 80, 81
18. N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of logic programs. In L. Naish, editor, Proc. of the Fourteenth Int. Conf. on Logic Programming, pages 63-77. MIT Press, July 1997. 83
19. L. Plumer. Termination Proofs for Logic Programs. LNAI 446. Springer Verlag, 1990. 80
20. A. Serebrenik and D. De Schreye. Termination analysis of logic programs using acceptability with general term orders. Technical Report CW 291, Departement Computerwetenschappen, K. U.Leuven, Leuven, Belgium, 2000. Available at http://www.cs.kuleuven.ac.be/publicaties/rapporten/CW2000.html. 72, 75, 81, 83
21. L. Sterling and E. Shapiro. The Art of Prolog. The MIT Press, 1994. 80