Theoretical foundations of value withdrawal explanations for domain reduction

Gérard Ferrand (1) , Willy Lesaint (1) , Alexandre Tessier (1)

1 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with chaotic iterations of monotonic operators. To each operator is associated its dual which will be described by a set of rules. For classical consistency notions, there exists a natural such system of rules. They express value removals as consequences of other value removals. The linking of these rules inductively defines proof trees. Such a proof tree clearly explains the removal of a value (the root of the tree). Explanations can be considered as the essence of domain reduction.

Domaines: Intelligence artificielle [cs.AI]

Gérard Ferrand, Willy Lesaint, Alexandre Tessier. Theoretical foundations of value withdrawal explanations for domain reduction. Electronic Notes in Theoretical Computer Science, 2002, 76, pp.99-114. ⟨hal-00514500⟩