Thumbnail
Access Restriction
Open

Author Payet, Etienne ♦ Mesnard, Fred
Source arXiv.org
Content type Text
File Format PDF
Date of Submission 2008-07-22
Language English
Subject Domain (in DDC) Computer science, information & general works
Subject Keyword Computer Science - Programming Languages ♦ cs
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.
Description Comment: 32 pages. Long version of a paper accepted for publication in Theory and Practice of Logic Programming (TPLP)
Educational Use Research
Learning Resource Type Article
Page Count 32


Open content in new tab

   Open content in new tab