Making bound consistency as effective as arc consistency

Authors:
Christian Bessiere;Thierry Petit;Bruno Zanuttini
Affiliations:
LIRMM, CNRS, U. Montpellier, France;LINA, CNRS, Ecole des Mines de Nantes, France;GREYC, CNRS, U. Caen, France
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 11
Cited 0

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the minimality and global consistency of row-convex constraint networks

Journal of the ACM (JACM)
Constraints, consistency and closure

Artificial Intelligence
A fast algorithm for the bound consistency of alldiff constraints

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Constraint satisfaction over connected row-convex constraints

Artificial Intelligence
Building tractable disjunctive constraints

Journal of the ACM (JACM)
When do bounds and domain propagation lead to the same search space?

ACM Transactions on Programming Languages and Systems (TOPLAS)
Filtering Algorithms for the NValue Constraint

Constraints
Domain permutation reduction for constraint satisfaction problems

Artificial Intelligence
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains

SIAM Journal on Computing
An efficient algorithm for a class of constraint satisfaction problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.