TALP: A tool for the termination analysis of logic programs

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

Volumn 1833, Issue , 2000, Pages 270-273

  Ohlebusch, Enno ^a   Claves, Claus ^a   Marché, Claude ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937438740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10721975_20     Document Type: Conference Paper

References (14)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 2000. To appear.
2. T. Arts and H. Zantema. Termination of logic programs using semantic unification. In Proc. 5th Int. Workshop on Logic Program Synthesis and Transformation, volume 1048 of Lecture Notes in Computer Science pages 219–233, 1996. Springer-Verlag.
3. F. Benhamou and A. Colmerauer, editors. Constraint Logic Programming: selected research. MIT Press, 1993.
4. CiME 2. Prerelease available at http://www.lri.fr/~demons/cime-2.0.html.
5. E. Contejean and C. Marché. CiME: Completion Modulo E. Proc. 7th Int. Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 416–419, July 1996. Springer-Verlag. System description available at http://www.lri.fr/~demons/cime.html.
6. E. Contejean, C. Marché, A.-P. Tomás, and X. Urbain. Solving termination constraints via finite domain polynomial interpretations. Draft, 1999.
7. M. Chtourou and M. Rusinowitch. Méthode transformationnelle pour la preuve de terminaison des programmes logiques. Unpublished manuscript, 1993.
8. S. Decorte, D. De Schreye, and H. Vandecasteele. Constraint-based termination analysis of logic programs. ACM TOPLAS, 1999. To appear.
9. J. Giesl. Generating polynomial orderings for termination proofs. In Proc. 6th Int. Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, April 1995. Springer-Verlag.
10. H. Ganzinger and U. Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. In Proc. 3rd Int. Workshop on Conditional Term Rewriting Systems, volume 656 of Lecture Notes in Computer Science, pages 113–127, Berlin, 1993. Springer-Verlag.
11. Hoon Hong and Dalibor Jakus. Testing positiveness of polynomials. Journal of Automated Reasoning, 21(1):23–38, August 1998.
12. N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of logic programs (with detailed experimental results). Technical report, Hebrew University, Jerusalem, 1997.
13. E. Ohlebusch. Transforming conditional rewrite systems with extra variables into unconditional systems. In Proc. 6th Int. Conference on Logic for Programming and Automated Reasoning, volume 1705 of Lecture Notes in Artificial Intelligence, pages 111–130, 1999. Springer-Verlag.
14. L. Plümer. Termination Proofs for Logic Programs, volume 446 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 1990.