Making Bound Consistency as Effective as Arc Consistency
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 425-429.
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
@inproceedings{ijcai2009p78,
title = {Making Bound Consistency as Effective as Arc Consistency},
author = {Bessiere, Christian and Petit, Thierry and Zanuttini, Bruno},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {425--429},
year = {2009},
url = {https://ijcai.org/proceedings/2009/78},
}
TY - CPAPER TI - Making Bound Consistency as Effective as Arc Consistency AU - Bessiere, Christian AU - Petit, Thierry AU - Zanuttini, Bruno T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 425 EP - 429 UR - https://ijcai.org/proceedings/2009/78 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
