Value withdrawal explanations: a theoretical tool for programming environments release_7e3n2rihnbbihcvbtysu3jpovy

by Willy Lesaint

Released as a article .

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)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2002-07-12
Version   v2
Language   en ?
arXiv  cs/0207050v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 7031169f-aaec-47aa-9d60-6c8ae6e99a83
API URL: JSON