On termination of constraint logic programs

  • Livio Colussi
  • Elena Marchiori
  • Massimo Marchiori
Computational Logic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 976)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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