An Improved Non-Termination Criterion for Binary Constraint Logic Programs
| dc.creator | Payet, Etienne | |
| dc.creator | Mesnard, Fred | |
| dc.date | 2005-08-24 | |
| dc.date.accessioned | 2026-07-07T03:23:22Z | |
| dc.date.available | 2026-07-07T03:23:22Z | |
| dc.description | 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. | |
| dc.description | In A. Serebrenik and S. Munoz-Hernandez (editors), Proceedings of the 15th Workshop on Logic-based methods in Programming Environments October 2005, Sitges. cs.PL/0508078 | |
| dc.identifier | https://arxiv.org/abs/cs/0508106 | |
| dc.identifier | http://arxiv.org/abs/cs/0508106 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32916 | |
| dc.subject | Programming Languages | |
| dc.subject | D.2.6 | |
| dc.title | An Improved Non-Termination Criterion for Binary Constraint Logic Programs | |
| dc.type | text |