Making Bound Consistency as Effective as Arc Consistency - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2009

Making Bound Consistency as Effective as Arc Consistency

Abstract

We study under what conditions bound consistency (BC) and arc consistency (AC), two forms of propagation used in constraint solvers, are equivalent to each other. We show that they prune exactly the same values when the propagated constraint is connected row convex / closed under median and its complement is row convex. This characterization is exact for binary constraints. Since row convexity depends on the order of the values in the domains, we give polynomial algorithms for computing orders under which BC and AC are equivalent, if any.
Fichier principal
Vignette du fichier
bpz09.pdf (126.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00382609 , version 1 (14-02-2014)

Identifiers

  • HAL Id : lirmm-00382609 , version 1

Cite

Christian Bessiere, Thierry Petit, Bruno Zanuttini. Making Bound Consistency as Effective as Arc Consistency. IJCAI'09: 21st International Joint Conference on Artificial Intelligence, Jul 2009, Pasadena, CA, United States. pp.425-430. ⟨lirmm-00382609⟩
333 View
162 Download

Share

Gmail Facebook X LinkedIn More