Value Withdrawal Explanations: a Theoretical Tool for Programming Environments - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Value Withdrawal Explanations: a Theoretical Tool for Programming Environments

Willy Lesaint

Résumé

Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been efficiently used in several constraints programming environments but there does not exist any formalization of them. This paper is an attempt to fill this lack. Furthermore, we hope that this theoretical tool could help to validate some programming environments. A value withdrawal explanation is a tree describing the withdrawal of a value during a domain reduction by local consistency notions and labeling. Domain reduction is formalized by a search tree using two kinds of operators: for local consistency notions and for labeling. These operators are defined by sets of rules. Proof trees are built with respect to these rules. For each removed value, there exists such a proof tree which is the withdrawal explanation of this value.
Fichier principal
Vignette du fichier
wlpe2002.pdf (215.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00459195 , version 1 (23-02-2010)

Identifiants

  • HAL Id : hal-00459195 , version 1

Citer

Willy Lesaint. Value Withdrawal Explanations: a Theoretical Tool for Programming Environments. 12th Workshop on Logic Programming Environments, 2002, Denmark. pp.17-33. ⟨hal-00459195⟩
72 Consultations
9 Téléchargements

Partager

Gmail Facebook X LinkedIn More