Skip to Main content Skip to Navigation
Conference papers

Inférence de non-terminaison pour les programmes logiques avec contraintes

Abstract : 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: non-termination relativement à 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 a necessary and sufficient criteria 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
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Réunion Univ <>
Submitted on : Monday, November 12, 2018 - 9:03:48 AM
Last modification on : Thursday, July 1, 2021 - 3:07:13 AM
Long-term archiving on: : Wednesday, February 13, 2019 - 1:31:27 PM


Explicit agreement for this submission


  • HAL Id : hal-01915272, version 1



Etienne Payet, Frédéric Mesnard. Inférence de non-terminaison pour les programmes logiques avec contraintes. 13èmes Journées Francophones de Programmation en Logique et Programmation par Contraintes (JFPLC 2004), Association Française pour la Programmation en Logique et la programmation par Contraintes, Jun 2004, Angers, France. pp.55-72. ⟨hal-01915272⟩



Record views


Files downloads