Polynomial interpretations as a basis for termination analysis of logic programs

Lecture Notes in Computer Science

Volumn 3668, Issue , 2005, Pages 311-325

  Nguyen, Manh Thang ^a   De Schreye, Danny ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Acceptability; Polynomial interpretations; Termination analysis

Indexed keywords

CODES (SYMBOLS); CONFORMAL MAPPING; CONSTRAINT THEORY; FUNCTION EVALUATION; POLYNOMIALS;

ACCEPTABILITY; POLYNOMIAL INTERPRETATIONS; REWRITING SYSTEMS; TERMINATION ANALYSIS;

LOGIC PROGRAMMING;

EID: 27144532833     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_24     Document Type: Conference Paper

References (18)

1. K. R. Apt. Logic programming. In Handbook of theoretical computer science (vol. B): formal models and semantics, pages 493-574. MIT Press, 1990.
2. A. Bossi, N. Cocco, and M. Fabris. Proving termination of logic programs by exploiting term properties. In TAPSOFT, Vol.2, pages 153-180, 1991.
3. E. Contejean, G. Marché, A. P. Tomás, and X. Urbain. Mechanically proving termination using polynomial interpretations. J. Auto. Reason., 2005.
4. D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. J. Log. Program., 19-20:199-260, 1994.
5. D. De Schreye and A. Serebrenik. Acceptability with general orderings. In Computational Logic: Logic Programming and Beyond, pages 187-210. Springer Verlag, 2002.
6. S. Decorte, D. De Schreye, and H. Vandecasteele. Constraint based automatic termination analysis of logic programs. ACM Trans. Program. Lang. Syst, 21(6):1137-1195, November 1999.
7. N. Dershowitz. Termination of rewriting. J. Symb. Comput., 3(1-2):69-116, 1987.
8. N. Dershowitz. 33 examples of termination. LNCS, 909:16-26, 1995.
9. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behaviour of logic languages. Theor. Comput. Sci., 63(3):289-318, 1989.
10. J. Giesl. Generating polynomial orderings for termination proofs. In RTA, pages 426-431, 1995.
11. G. Janssen and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Log. Program., 13(2&3):205-258, 1992.
12. D. S. Lankford. On proving term rewriting systems are noetherian. Technical report, Mathematics Department, Louisiana Tech. University, Ruston, LA, 1979.
13. J. W. Lloyd. Foundations of Logic Programming. Springer Verlag, Berlin, 1987.
14. M. T. Nguyen and D. De Schreye. Polynomial interpretations as a basis for termination analysis of logic programs. Technical report, Department of Computer Science, K.U.Leuven, Belgium, 2005.
15. A. Serebrenik. Termination Analysis of Logic Programs. PhD thesis, Department of Computer Science, K.U.Leuven, Belgium, 2003.
16. J. Steinbach. Generating polynomial orderings. Inf. Process. Lett., 49(2):85-93, 1994.
17. K. Verschaetse and D. De Schreye. Deriving termination proofs for logic programs, using abstract procedures. In Proceedings 8th ICLP, pages 301-315, 1991.
18. H. Zantema. Termination, In Terese, Term Rewriting Systems, chapter 6. Cambridge Univ. Press, 2003.