A non-termination criterion for binary constraint logic programs
| Autor: | Fred Mesnard, Étienne Payet |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
FOS: Computer and information sciences
Concurrent constraint logic programming Computer Science - Programming Languages Theoretical computer science Horn clause Computer science 020207 software engineering 0102 computer and information sciences 02 engineering and technology Non-classical logic 01 natural sciences Higher-order logic Theoretical Computer Science Computational Theory and Mathematics 010201 computation theory & mathematics Artificial Intelligence Hardware and Architecture Constraint logic programming 0202 electrical engineering electronic engineering information engineering Constraint programming Rule of inference Software Logic programming Programming Languages (cs.PL) |
| Zdroj: | Theory and Practice of Logic Programming. 9:145-164 |
| ISSN: | 1475-3081 1471-0684 |
| Popis: | 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. 32 pages. Long version of a paper accepted for publication in Theory and Practice of Logic Programming (TPLP) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|