BiBiServ2 - TALP

Welcome

Download

References

Ohlebusch, Enno and Claves, Claus and Marche, Claude Transforming conditional rewrite systems with extra variables into unconditional systems, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, volume 1705 of Lecture Notes in Artificial Intelligence, pages 111-130, Berlin, Springer-Verlag, 1999
Arts, T. and Giesl, J. Modularity of termination using dependency pairs, Proceedings of the 9th International Conference on Rewriting Techniques and Applications, volume 1379 of Lecture Notes in Computer Science, pages 226-240, Berlin, Springer-Verlag, 1998
Arts, T. and Giesl, J. Termination of term rewriting using dependency pairs, Theoretical Computer Science, 236(1&2):133-178, 2000
Apt, K. R. and Pedreschi, D. H. Modular termination proofs for logic and pure prolog programs, Advances in Logic Programing Theory, pages 183-229. Oxford University Press, 1994
Arts, T. and Zantema, H. Termination of logic programs using semantic unification, Proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, volume 1048 of Lecture Notes in Computer Science, pages 219-233, Berlin, Springer-Verlag, 1996
Codish, M. and Taboch, C. A semantic basis for the termination analysis of logic programs, Journal of Logic Programming, 41:103-123, 1999
Ganzinger, H. and Waldmann, U. Termination proofs of well-moded logic programs via conditional rewrite systems, Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, volume 656 of Lecture Notes in Computer Science, pages 113-127, Berlin, Springer-Verlag, 1993
M. R. K. Krishna Rao, D. Kapur and Shyamasundar, R. K. A transformational methodology for proving termination of logic programs, Journal of Logic Programming, 34:1-41, 1998
Lindenstrauss, N. and Sagiv, Y. Automatic termination analysis of logic programs (with detailed experimental results), Technical report, Hebrew University, Jerusalem, 1997
L. Pluemer Termination Proofs for Logic Programs, Lecture Notes in Artificial Intelligence, volume 446, Springer-Verlag, Berlin, 1990
Schreye, D. De and Decorte, S. Termination of logic programs: The never-ending story., Journal of Logic Programming, 19&20:199-260, 1994