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. Christian Bessiere, Thierry Petit, Bruno Zanuttini
Cite
Text
Bessiere et al. "Making Bound Consistency as Effective as Arc Consistency." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Bessiere et al. "Making Bound Consistency as Effective as Arc Consistency." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/bessiere2009ijcai-making/)BibTeX
@inproceedings{bessiere2009ijcai-making,
title = {{Making Bound Consistency as Effective as Arc Consistency}},
author = {Bessiere, Christian and Petit, Thierry and Zanuttini, Bruno},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {425-430},
url = {https://mlanthology.org/ijcai/2009/bessiere2009ijcai-making/}
}