2008/07/22 by Etienne Payet, Fred Mesnard, Payet, Etienne +1
Computer Science · #FOS: Computer and information sciences #Programming Languages (cs.PL) #cs.PL
paper · pdf · doi:10.48550/arxiv.0807.3451
32 pages. Long version of a paper accepted for publication in Theory and Practice of Logic Programming (TPLP)
arxiv created 2009/01/10 · arxiv updated 2009/12/01
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.