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.
http://hal.univ-reunion.fr/hal-01186175
Contributor : Nicolas Alarcon
<>
Submitted on : Thursday, November 8, 2018 - 12:57:01 PM
Last modification on : Monday, September 2, 2019 - 9:43:06 AM
Long-term archiving on : Saturday, February 9, 2019 - 1:48:45 PM
Etienne Payet, Frédéric Mesnard. A Non-Termination Criterion for Binary Constraint Logic Programs. Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2009, 9 (2), pp.145-164. ⟨hal-01186175⟩
