An Improved Non-Termination Criterion for Binary Constraint Logic Programs
<|reference_start|>An Improved Non-Termination Criterion for Binary Constraint Logic Programs: On 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 clauses, which strictly generalizes our previous works on this subject. We give a generic operational definition and a logical form of this criterion. Then we show that the logical form is correct and complete with respect to the operational definition.<|reference_end|>
@article{payet2005an,
    title={An Improved Non-Termination Criterion for Binary Constraint Logic
  Programs},
    author={Etienne Payet and Fred Mesnard},
    journal={arXiv preprint arXiv:cs/0508106},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0508106},
    primaryClass={cs.PL}
}