Proving existential termination of normal logic programs

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

Volumn 1101, Issue , 1996, Pages 375-390

  Marchiori, Massimo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; LOGIC PROGRAMMING; SOFTWARE ENGINEERING;

LOGIC PROGRAMS; TERM REWRITING SYSTEMS; TERMINATION PROPERTY;

COMPUTER CIRCUITS;

EID: 84947910004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014328     Document Type: Conference Paper

References (30)

1. G. Aguzzi and U. Modigliani. Proving termination of logic programs by transforming them into equivalent term rewriting systems. FST&TCS, LNCS 761, pp. 114-124. 1993.
2. A. Aiken and T.K. Lakshman. Directional type checking of logic programs. In Proc. of SAS, LNCS 864, pages 43-60, 1994.
3. K.R. Apt and S. Etalle. On the unification free Prolog programs. Proc MFCS LNCS 711, pp. 1-19. Springer, 1993.
4. K.R. Apt and D. Pedreschi. Proving termination of general Prolog programs. In Proc TACS, LNCS 526, pages 265-289. Springer-Verlag, 1991.
5. T. Arts and H. Zantema. Termination of logic programs using semantic unification. In Proc. 5th LoPSTr, LNCS. 1996. To appear.
6. M. Baudinet. Proving termination properties of Prolog programs: a semantic approach. Journal of Logic Programming, 14:1-29, 1992.
7. F. Bronsard, T.K. Lakshman, and U.S Reddy. A framework of directionality for proving termination of logic programs. Proc. JICSLP, pp. 321-335. The MIT Press, 1992.
8. M. Chtourou and M. Rusinowitch. Méthode transformationnelle pour la preuve de terminaison des programmes logiques. Manuscript, 1993.
9. K.L. Clark and S.-Å. Tärnlund. A first order theory of data and programs. In B. Gilchrist, editor, Proc. IFIP Congress on Information Processing, pp. 939-944, 1977.
10. H. Coelho and J.C. Cotta. Prolog by Example. Springer-Verlag, 1988.
11. L. Colussi, E. Marchiori, and M. Marchiori. On termination of constraint logic programs. In Proc. CP'95, LNCS 976, pp. 431-448. Springer, 1995.
12. T. Conway, F. Henderson, and Z. Somogyi. Code generation for Mercury. In Proc. International Logic Programming Symposium, pp. 242-256. The MIT Press, 1995.
13. D. de Schreye and S. Decorte. Termination of logic programs: The never-ending story. Journal of Logic Programming, 19,20:199-260, 1994.
14. S.K. Debray. Static inference of modes and data dependencies in logic programs. ACM TOPLAS, 11(3):418-450, July 1989.
15. N. Dershowitz. Termination of rewriting. J. of Symbolic Computation, 3:69-116, 1987.
16. N. Dershowitz and C. Hoot. Topics in termination. In Proceedings of the Fifth RTA, LNCS 690, pp. 198-212. Springer, 1993.
17. N. Dershowitz and J. Jouannaud. Rewrite systems. Handbook of Theoretical Computer Science, vol. B, chapter 6, pp. 243-320. Elsevier-MIT Press, 1990.
18. N. Franchez, O. Grumberg, S. Katz, and A. Pnueli. Proving termination of Prolog programs. In R. Parikh, editor, Logics of programs, pp. 89-105. Springer, 1985.
19. H. Ganzinger and U. Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. CTRS'92, LNCS 656, pp. 216-222. Springer, 1993.
20. G. Levi and F. Scozzari. Contributions to a theory of existential termination for definite logic programs. GULP-PRODE'95, pp. 631-642. 1995.
21. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.
22. E. Marchiori. Practical methods for proving termination of general logic programs. The Journal of Artificial Intelligence Research, 1996. To appear.
23. M. Marchiori. Logic programs as term rewriting systems. Proc. 3rd Int. Conf. on Algebraic and Logic Programming, LNCS 850, pp. 223-241. Springer, 1994.
24. M. Marchiori. Localizations of unification freedom through matching directions. Proc. International Logic Programming Symposium, pp. 392-406. The MIT Press, 1994.
25. M. Marchiori. The functional side of logic programming. In Proc. ACM FPCA, pages 55-65. ACM Press, 1995.
26. K. Rao, D. Kapur, and R.K. Shyamasundar. A transformational methodology for proving termination of logic programs. 5th CSL, LNCS 626, pp. 213-226, Springer, 1992.
27. K Rao, P.K. Pandya, and R.K. Shyamasunder. Verification tools in the development of provably correct compilers. FME'93, LNCS 670, pp. 442-461. Springer, 1993.
28. Y. Rouzaud and L. Nguyen-Phoung. Integrating modes and subtypes into a Prolog type checker. In Proc. JICSLP, pages 85-97. The MIT Press, 1992.
29. L. Sterling and E. Shapiro. The Art of Prolog. The MIT Press, 1986.
30. B. Wang and R.K. Shyamasundar. A methodology for proving termination of logic programs. Journal of Logic Programming, 21(1):1-30, 1994.