A Non-Termination Criterion for Binary Constraint Logic Programs

Details A Non-Termination Criterion for Binary Constraint Logic Programs A Non-Termination Criterion for Binary Constraint Logic Programs

2008-07-22

arxiv.org/abs/0807.3451v3

Computer Science

Programming Languages

32 pages. Long version of a paper accepted for publication in Theory and Practice of Logic Programming (TPLP)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Non-Termination Criterion for Binary Constraint Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Non-Termination Criterion for Binary Constraint Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Non-Termination Criterion for Binary Constraint Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-436054