A Non-Termination Criterion for Binary Constraint Logic Programs

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.
Type de document :
Article dans une revue
Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2009, 9 (2), pp.145-164
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

http://hal.univ-reunion.fr/hal-01186175
Contributeur : Nicolas Alarcon <>
Soumis le : jeudi 8 novembre 2018 - 12:57:01
Dernière modification le : mardi 13 novembre 2018 - 06:35:37

Fichier

A_non_termination_criterion_fo...
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : hal-01186175, version 1

Collections

Citation

Etienne Payet, Frédéric Mesnard. A Non-Termination Criterion for Binary Constraint Logic Programs. Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2009, 9 (2), pp.145-164. 〈hal-01186175〉

Partager

Métriques

Consultations de la notice

5

Téléchargements de fichiers

3