A Non-Termination Criterion for Binary Constraint Logic Programs - Université de La Réunion Access content directly
Journal Articles Theory and Practice of Logic Programming Year : 2009

A Non-Termination Criterion for Binary Constraint Logic Programs

Abstract

On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches: dynamic versus static analysis, this paper belongs to the latter. It proposes a criterion for detecting non-terminating atomic queries with respect to binary CLP rules, which strictly generalizes our previous works on this subject. We give a generic operational definition and an implemented logical form of this criterion. Then we show that the logical form is correct and complete with respect to the operational definition.
Fichier principal
Vignette du fichier
A_non_termination_criterion_for_binary_constraint_logic_programs.pdf (391.49 Ko) Télécharger le fichier
Origin Explicit agreement for this submission
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-01186175 , version 1

Cite

Etienne Payet, Frédéric Mesnard. A Non-Termination Criterion for Binary Constraint Logic Programs. Theory and Practice of Logic Programming, 2009, 9 (2), pp.145-164. ⟨hal-01186175⟩
82 View
103 Download

Share

Gmail Mastodon Facebook X LinkedIn More