Transformational methodology for proving termination of logic programs

Journal of Logic Programming

Volumn 34, Issue 1, 1998, Pages 1-41

  Krishna Rao, M R K ^b   Kapur, Deepak ^b   Shyamasundar, R K ^a  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS; PROLOG (PROGRAMMING LANGUAGE); THEOREM PROVING;

TRANSFORMATIONAL METHODOLOGY;

LOGIC PROGRAMMING;

EID: 0039346788     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)00028-9     Document Type: Article

References (40)

1. Aguzzi, G. and Modigliani, U., Proving Termination of Logic Program by Transforming Them into Equivalent Term Rewriting Systems, in: Proc. 13th Conf. Foundations Software Technol. Theoret. Comput. Sci. (FST&TCS'93), Lecture Notes in Computer Science 761, Springer Verlag, New York, 1993, pp. 114-124.
2. Apt, K. R., Logic Programming, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990, Vol. B, pp. 493-574.
3. Apt, K. R. and Etalle, S., On the Unification Free Prolog Programs, in: Proc. MFCS'93, Lecture Notes in Computer Science 711, Springer Verlag, New York, 1993, pp. 1-19.
4. Apt, K. R. and Pedreschi, D., Reasoning about Termination of Pure Prolog Programs, Information Computation 106:109-157 (1993).
5. Arts, T. and Zantema, H., Termination of Logic Programs via Labelled Term Rewrite Systems, TR UU-CS-1994-20, Utrecht University, 1994.
6. Baudinet, M., Proving Termination Properties of Prolog Programs: A Semantic Approach, Proc. LICS'88 (revised version in J. Logic Programming 15:1-29 (1988).
7. Bezem, M., Strong Termination of Logic Programs, J. Logic Programming 15:79-98 (1989).
8. Bossi, A., Cocco, N., and Fabris, M., Proving Termination of Logic Programs by Exploiting Term Properties, Proc. TAPSOFT'91, Lecture Notes in Computer Science 494, Springer Verlag, New York, 1991, pp. 153-181.
9. Chtourou, M. and Rusinowitch, M., A Transformation from Logic Programs to Term Rewrite Systems and Its Application to Termination, draft, CRIN-INRIA, Lorraine, France, 1993.
10. Conery, J. S. and Kibler, D. F., AND Parallelism and Nondeterminism in Logic Programming, New Generation Comput. 3:43-70 (1985).
11. Dauchet, M., Simulation of Turing Machines by a Left-Linear Rewrite Rule, Proc. RTA'89, Lecture Notes in Computer Science 355, Springer Verlag, New York, 1989, pp. 109-120.
12. De Schreye, D. and Verschaetse, K., Termination Analysis of Definite Logic Programs with Respect to Call Patterns, TR CW 138, Department of Computer Science, K. U. Leuven, Belgium, 1992.
13. De Schreye, D., Verschaetse, K., and Bruynooghe, M., A Framework for Analyzing the Termination of Definite Logic Programs, Proc. FGCS92, ICOT, 1992, pp. 481-488.
14. De Schreye, D. and Decorte, S., Termination of Logic Programs: The Never-Ending Story, J. Logic Programming 19/20:199-260 (1993).
15. Debray, S. K. and Warren, D. S., Automatic Mode Inference for Logic Programs, J. Logic Programming 5:207-229 (1988).
16. Dembinski, P. and Maluszinski, J., And-Parallelism with Intelligent Backtracking for Annotated Logic Programs, Int. Symp. Logic Programming, 1985.
17. Dershowitz, N., Orderings for Term-Rewriting Systems, TCS 17:279-301 (1982).
18. Dershowitz, N., Terminiation of Rewriting, J. Symb. Comp. 3:69-116 (1987).
19. Dershowitz, N. and Jouannaud, J.-P., Rewrite Systems, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990, Vol. B, pp. 243-320.
20. Francez, N., Grumberg, O., Katz, S., and Pnueli, A., Proving Termination of Prolog Programs, in: Proc. Logics Programs, Lecture Notes in Computer Science 193, Springer Verlag, New York, 1985, pp. 89-105.
21. Ganzinger, H. and Waldmann, U., Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems, in: Proc. CTRS'92, Lecture Notes in Computer Science 656, Springer Verlag, New York, 1992, pp. 430-437.
22. Kamin, S. and Levi, J.-J., Two Generalizations of Recursive Path Ordering, Unpublished note, Department of Computer Science, University of Illinois, Urbana, IL, 1980.
23. Kapur, D. and Zhang, H., An Overview of Rewrite Rule Laboratory (RRL), in: Proc. RTA'89, Lecture Notes in Computer Science 355, Springer Verlag, New York, 1989, pp. 559-563.
24. Krishna Rao, M. R. K., Kapur, D., and Shyamasundar, R. K., A Transformational Methodology for Proving Termination of Logic Programs, in: Proc. Comput. Sci. Logic, CSL'91, Lecture Notes in Computer Science 626, Springer Verlag, New York, 1991, pp. 213-226.
25. Krishna Rao, M. R. K., Pandya, P. K., and Shyamasundar, R. K., Verification Tools in the Development of Provably Correct Compilers, in: Proc. 5th Symp. Formal Methods Europe, FME'93, Lecture Notes in Computer Science 670, Springer Verlag, New York, 1993, pp. 442-461.
26. Krishna Rao, M. R. K. and Shyamasundar, R. K., Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs, in: Proc. Static Analysis Symp., SAS'95, Lecture Notes in Computer Science 983, Springer Verlag, New York, 1994, pp. 243-260.
27. Lescanne, P., Computer Experiments with the REVE Term Rewriting Systems Generator, in: Proc. 10th ACM POPL'83, 1983, pp. 99-108.
28. Lescanne, P., Termination of Rewriting Systems by Elementary Interpretations, in: Proc. Algebraic Logic Prog., ALP'92, Lecture Notes in Computer Science 632, Springer Verlag, New York, 1992, pp. 21-36.
29. Lloyd, J. W., Foundations of Logic Programming, Springer Verlag, New York, 1987.
30. Marchiori, M., Logic Programs as Term Rewriting Systems, in: Proc. Algebraic Logic Prog. ALP '94, Lecture Notes in Computer Science 850, Springer Verlag, New York, 1994, pp. 223-241.
31. Marchiori, M., Localizations of Unification Freedom Trough Matching Directions, Proc. Int. Symp. Logic Programming, ILPS '94, MIT Press, Cambridge, MA, 1994.
32. Plumer, L., Termination Proofs for Logic Programs, Ph.D. Thesis, University of Dortmund (also appears as Lecture Notes in Computer Science 446, Springer Verlag, New York, 1990).
33. Plumer, L., Automatic Termination Proofs for Prolog Programs Operating on Non-ground Terms, in: Proc. ILPS'91, MIT Press, Cambridge, MA, 1991, pp. 503-517.
34. Shyamasundar, R. K., Krishna Rao, M. R. K., and Kapur, D., Rewriting Concepts in the Study of Termination of Logic Programs, in: K. Broda (ed.), Proc. ALPUK'92 Conf. Workshops in Computing Series, Springer Verlag, New York, 1990, pp. 3-20.
35. Ullman, J. D. and van Gelder, A., Efficient Tests for Top-Down Termination of Logical Rules, JACM 35:345-373 (1988).
36. Vasak, T. and Potter, J., Characterization of Terminating Logic Programs, Third IEEE Symp. Logic Programming 140-147 (1986).
37. Verschaetse, K., Static Termination Analysis for Definite Horn Clause Logic Programs, Ph.D. Thesis, K. U. Leuven, Leuven, Belgium, 1992.
38. Wang, B. and Shyamasundar, R. K., Towards a Characterization of Termination of Logic Programs, in: Proc. PLILP'90, Lecture Notes in Computer Science 456, Springer Verlag, New York, 1990, pp. 203-221.
39. Wang, B. and Shyamasundar, R. K., Methodology for Proving the Termination of Logic Programs, in: Proc. STACS'91, Lectuw Notes in Computer Science 480, Springer Verlag, New York, 1991, pp. 214-227.
40. Zantema, H., Termination of Term Rewriting by Semantic Labelling, Fundamenta Informaticae 24:89-105 (1995).