On termination of constraint logic programs

  • Livio Colussi
  • Elena Marchiori
  • Massimo Marchiori
Computational Logic

DOI: 10.1007/3-540-60299-2_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 976)
Cite this paper as:
Colussi L., Marchiori E., Marchiori M. (1995) On termination of constraint logic programs. In: Montanari U., Rossi F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg

Abstract

This paper introduces a necessary and sufficient condition for termination of constraint logic programs. The method is based on assigning a dataflow graph to a program, whose nodes are the program points and whose arcs are abstractions of the rules of a transition system, describing the operational behaviour of constraint logic programs. Then termination is proven using a technique inspired by the seminal approach of Floyd for proving termination of flowchart programs.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Livio Colussi
    • 1
  • Elena Marchiori
    • 2
  • Massimo Marchiori
    • 1
  1. 1.Dept. of Pure and Applied MathematicsPadovaItaly
  2. 2.CWIGB AmsterdamThe Netherlands

Personalised recommendations