TY - JOUR AU - Bessiere, Christian AU - Paparrizou, Anastasia AU - Stergiou, Kostas PY - 2015/03/04 Y2 - 2024/03/29 TI - Strong Bounds Consistencies and Their Application to Linear Constraints JF - Proceedings of the AAAI Conference on Artificial Intelligence JA - AAAI VL - 29 IS - 1 SE - Main Track: Search and Constraint Satisfaction DO - 10.1609/aaai.v29i1.9756 UR - https://ojs.aaai.org/index.php/AAAI/article/view/9756 SP - AB - <p> We propose two local consistencies that extend bounds consistency (BC) by simultaneously considering combinations of constraints as opposed to single constraints. We prove that these two local consistencies are both stronger than BC, but are NP-hard to enforce even when constraints are linear. Hence, we propose two polynomial-time techniques to enforce approximations of these two consistencies on linear constraints. One is a reformulation of the constraints on which we enforce BC whereas the other is a polynomial time algorithm. Both achieve stronger pruning than BC. Our experiments show large differences in favor of our approaches. </p> ER -