Making Bound Consistency as Effective as Arc Consistency

Christian Bessière 1 Thierry Petit 2, 3 Bruno Zanuttini 4
1 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
4 Equipe MAD - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
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.
Type de document :
Communication dans un congrès
IJCAI'09: 21st International Joint Conference on Artificial Intelligence, Jul 2009, Pasadena, CA, United States. pp.425-430, 2009, Constraints, Satisfiability, and Search. <https://www.aaai.org/ocs/index.php/IJCAI/IJCAI-09/paper/view/525>
Liste complète des métadonnées


https://hal-lirmm.ccsd.cnrs.fr/lirmm-00382609
Contributeur : Christian Bessiere <>
Soumis le : vendredi 14 février 2014 - 15:18:53
Dernière modification le : samedi 10 juin 2017 - 01:08:14
Document(s) archivé(s) le : jeudi 15 mai 2014 - 09:40:57

Fichier

bpz09.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : lirmm-00382609, version 1

Citation

Christian Bessière, 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, 2009, Constraints, Satisfiability, and Search. <https://www.aaai.org/ocs/index.php/IJCAI/IJCAI-09/paper/view/525>. <lirmm-00382609>

Partager

Métriques

Consultations de
la notice

280

Téléchargements du document

187