Automated termination analysis for logic programs by term rewriting

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

Volumn 4407 LNCS, Issue , 2007, Pages 177-193

  Schneider Kamp, Peter ^a   Giesl, Jürgen ^a   Serebrenik, Alexander ^b   Thiemann, René ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER SIMULATION; MATHEMATICAL TRANSFORMATIONS;

TERM REWRITING; TERMINATION ANALYSIS;

LOGIC PROGRAMMING;

EID: 34548143045     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-71410-1_13     Document Type: Conference Paper

References (33)

1. G. Aguzzi and U. Modigliani. Proving termination of logic programs by transforming them into equivalent term rewriting systems. In Proc. 13th FST & TCS, LNCS 761, pages 114-124, 1993.
2. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
3. K. R. Apt and S. Etalle. On the unification free Prolog programs. In Proc. 18th MFCS, LNCS 711, pages 1-19, 1993.
4. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
5. T. Arts and H. Zantema. Termination of logic programs using semantic unification. In Proc. 5th LOPSTR, LNCS 1048, pages 219-233, 1995.
6. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge, 1998.
7. M. Bruynooghe, M. Codish, J. Gallagher, S. Genaim, and W. Vanhoof. Termination analysis of logic programs through combination of type-based norms. ACM Transactions on Programming Languages and Systems, 2006. To appear.
8. M. Chtourou and M. Rusinowitch. Méthode transformationelle pour la preuve de terminaison des programmes logiques. Unpublished manuscript, 1993.
9. M. Codish, V. Lagoon, and P. Stuckey. Testing for termination with monotonicity constraints. In Proc. 21st ICLP, LNCS 3668, pages 326-340, 2005.
10. M. Codish and C. Taboch. A semantic basis for termination analysis of logic programs. Journal of Logic Programming, 41(1):103-123, 1999.
11. A. Colmerauer. Prolog and infinite trees. In K. L. Clark and S. Tärnlund, editors, Logic Programming. Academic Press, 1982.
12. D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. Journal of Logic Programming, 19&20:199-260, 1994.
13. D. De Schreye and A. Serebrenik. Acceptability with general orderings. In Computational Logic. Logic Prog, and Beyond., LNCS 2407, pages 187-210, 2002.
14. N. Dershowitz. Termination of rewriting. J. Symb. Comp., 3:69-116, 1987.
15. H. Ganzinger and U. Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. Proc. 3rd CTRS, LNCS 656, pages 216-222, 1993.
16. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The dependency pair framework: Combining techniques for automated termination proofs. In Proc. 11th LPAR, LNAI 3452, pages 301-331, 2005.
17. J. Giesl, P. Schneider-Kamp, R. Thiemann. AProVE 1.2: Automatic termination proofs in the DP framework. In Proc. 3rd IJCAR, LNAI 4130, pp. 281-286, 2006.
18. G. Huet. Resolution d'équations dans les langages d'ordre 1, 2,..., ω PhD, 1976.
19. M. Krishna Rao, D. Kapur, and R. Shyamasundar. Transformational methodology for proving termination of logic programs. J. Log. Prog., 34(1):1-42, 1998.
20. V. Lagoon, F. Mesnard, and P. J. Stuckey. Termination analysis with types is more accurate. In Proc. 19th ICLP, LNCS 2916, pages 254-268, 2003.
21. M. Leuschel and M. H. Sørensen. Redundant argument filtering of logic programs. In Proc. 6th LOPSTR, LNCS 1207, pages 83-103, 1996.
22. N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. TermiLog: A system for checking termination of queries to logic programs. Proc. 9th CAV, LNCS 1254, p. 444-447, 1997.
23. M. Marchiori. Logic programs as term rewriting systems. In Proc. 4th ALP, LNCS 850, pages 223-241, 1994.
24. M. Marchiori. Proving existential termination of normal logic programs. In Proc. 5th AMAST, LNCS 1101, pages 375-390, 1996.
25. F. Mesnard and R. Bagnara. cTI: A constraint-based termination inference tool for ISO-Prolog. Theory and Practice of Logic Programming, 5(1&2):243-257, 2005.
26. F. Mesnard and S. Ruggieri. On proving left termination of constraint logic programs. ACM Transaction on Computational Logic, 4(2):207-259, 2003.
27. M. T. Nguyen and D. De Schreye. Polynomial interpretations as a basis for termination analysis of logic programs. Proc. 21. ICLP, LNCS 3668, p.311-325, 2005.
28. E. Ohlebusch. Termination of logic programs: Transformational methods revisited. Appl. Algebra in Engineering, Communication and Computing, 12:73-116, 2001.
29. E. Ohlebusch, C. Claves, and C. Marché. TALP: A tool for the termination analysis of logic programs. In Proc. 11th RTA, LNCS 1833, pages 270-273, 2000.
30. F. van Raamsdonk. Translating logic programs into conditional rewriting systems. In Proc. 14th ICLP, pages 168-182. MIT Press, 1997.
31. A. Serebrenik and D. De Schreye. Proving termination with adornments. In Proc. 13th LOPSTR, LNCS 3018, pages 108-109, 2003.
32. A. Serebrenik and D. De Schreye. Inference of termination conditions for numerical loops in Prolog. Theory and Practice of Logic Programming, 4:719-751, 2004.
33. J.-G. Smaus. Termination of logic programs using various dynamic selection rules. In Proc. 20th ICLP, LNCS 3132, pages 43-57, 2004.