An improved non-termination criterion for binary constraint logic programs - Université de La Réunion Access content directly
Conference Papers Year : 2005

An improved non-termination criterion for binary constraint logic programs


Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given class of queries, i.e. finiteness of all the possible derivations produced by a Prolog engine from any query in that class. In contrast, the study of the dual problem: nontermination w.r.t. the left selection rule i.e the existence of one query in a given class of queries which admits an infinite left derivation, has given rise to only a few papers. In this article, we study non-termination in the more general constraint logic programming framework. We rephrase our previous logic programming approach into this more abstract setting, which leads to a criterion expressed in a logical way and simpler proofs, as expected. Also, by reconsidering our previous work, we now prove that in some sense, we already had the best syntactic criterion for logic programming. Last but not least, we offer a set of correct algorithms for inferring non-termination for CLP.
Fichier principal
Vignette du fichier
An_improved_non_termination_criterion_for_binary_constraint_logic_programs.pdf (212.99 Ko) Télécharger le fichier
Origin Explicit agreement for this submission

Dates and versions

hal-01915757 , version 1 (08-11-2018)


  • HAL Id : hal-01915757 , version 1


Frédéric Mesnard, Etienne Payet. An improved non-termination criterion for binary constraint logic programs. 15th International Workshop on Logic Programming Environments (WLPE'05), Universidad Politécnica de Madrid; Technische Universiteit Eindhoven, Oct 2005, Barcelone, Spain. pp.46-60. ⟨hal-01915757⟩
30 View
9 Download


Gmail Mastodon Facebook X LinkedIn More