Value withdrawal explanations: a theoretical tool for programming
environments
release_7e3n2rihnbbihcvbtysu3jpovy
by
Willy Lesaint
2002
Abstract
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: operators for local
consistency notions and operators 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.
In text/plain
format
Archived Files and Locations
application/pdf 187.1 kB
file_6sfwltbfqjhq7mres2qwwwh3ti
|
archive.org (archive) |
cs/0207050v2
access all versions, variants, and formats of this works (eg, pre-prints)