Abstract : We propose two local consistencies that extend bounds consistency (BC) by simultaneously considering com- binations 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 experi- ments show large differences in favor of our approaches.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01276177
Contributor : Joël Quinqueton
<>
Submitted on : Thursday, February 18, 2016 - 9:13:55 PM
Last modification on : Wednesday, June 26, 2019 - 1:43:47 PM
Long-term archiving on: Sunday, November 13, 2016 - 12:06:06 AM
Christian Bessière, Anastasia Paparrizou, Kostas Stergiou. Strong Bounds Consistencies and Their Application to Linear Constraints. AAAI Conference on Artificial Intelligence, Jan 2015, Austin, TX, United States. pp.3717-3724. ⟨lirmm-01276177⟩
