. Bessiere, Filtering Algorithms for the NValue Constraint, Constraints, vol.48, issue.22, pp.271-293, 2006.
DOI : 10.1007/s10601-006-9001-9
URL : https://hal.archives-ouvertes.fr/lirmm-00106098

. Cohen, Constraint propagation Building tractable disjunctive constraints, Handbook of Constraint Programming, pp.47826-853, 2000.
DOI : 10.1145/355483.355485
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6124

. Deville, Constraint satisfaction over connected row convex constraints Efficient algorithms for description problems over finite totally ordered domains Domain permutation reduction for constraint satisfaction problems, Artif. Intel. SIAM J. Computing Artif. Intel, vol.109, issue.172, pp.243-271922, 1999.

. Jeavons, Constraints, consistency and closure, Artificial Intelligence, vol.101, issue.1-2, pp.251-265, 1998.
DOI : 10.1016/S0004-3702(98)00022-8
URL : http://doi.org/10.1016/s0004-3702(98)00022-8

]. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

]. Puget, A fast algorithm for the bound consistency of alldiff constraints, Proc. AAAI'98, 1998.

]. Régin, A filtering algorithm for constraints of difference in CSPs, Proc. AAAI'94, 1994.

S. Schulte, P. J. Schulte, and . Stuckey, When do bounds and domain propagation lead to the same search space?, ACM Transactions on Programming Languages and Systems, vol.27, issue.3, pp.388-425, 2005.
DOI : 10.1145/1065887.1065889

. Van-beek, ]. P. Dechter, R. Van-beek, and . Dechter, On the minimality and global consistency of row-convex constraint networks, Journal of the ACM, vol.42, issue.3, pp.543-561, 1995.
DOI : 10.1145/210346.210347

]. G. Woeginger, An efficient algorithm for a class of constraint satisfaction problems, Operations Research Letters, vol.30, issue.1, pp.9-16, 2002.
DOI : 10.1016/S0167-6377(01)00114-6

R. Zhang and . Yap, Arc consistency on n-ary monotonic and linear constraints, Proc. CP'00