K. R. Apt, Principles of Constraint Programming, 2003.
DOI : 10.1017/CBO9780511615320

H. Bennaceur, C. Lecoutre, and O. Roussel, A decomposition technique for solving Max- CSP, Proceedings of ECAI'08, pp.500-504, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00865285

C. Bessiere, Constraint Propagation, Handbook of Constraint Programming, 2006.
DOI : 10.1016/S1574-6526(06)80007-6
URL : https://hal.archives-ouvertes.fr/lirmm-00117128

C. Bessiere, K. Stergiou, and T. Walsh, Domain filtering consistencies for non-binary constraints, Artificial Intelligence, vol.172, issue.6-7, pp.800-822, 2008.
DOI : 10.1016/j.artint.2007.10.016
URL : https://hal.archives-ouvertes.fr/lirmm-00250086

M. C. Cooper, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, Artificial Intelligence, vol.90, issue.1-2, pp.1-24, 1997.
DOI : 10.1016/S0004-3702(96)00018-5

R. Debruyne and C. Bessiere, Domain filtering consistencies, Journal of Artificial Intelligence Research, vol.14, pp.205-230, 2001.

R. Dechter, Constraint processing, 2003.

R. Dechter and P. Van-beek, Local and global relational consistency, Theoretical Computer Science, vol.173, issue.1, pp.283-308, 1997.
DOI : 10.1016/S0304-3975(97)86737-0
URL : http://doi.org/10.1016/s0304-3975(97)86737-0

F. Focacci and M. Milano, Global Cut Framework for Removing Symmetries, Proceedings of CP'01, pp.77-92, 2001.
DOI : 10.1007/3-540-45578-7_6

E. C. Freuder, A sufficient condition for backtrack-bounded search, Journal of the ACM, vol.32, issue.4, pp.755-761, 1985.
DOI : 10.1145/4221.4225

E. C. Freuder, Eliminating interchangeable values in constraint satisfaction problems, Proceedings of AAAI'91, pp.227-233, 1991.

E. C. Freuder and C. Elfe, Neighborhood inverse consistency preprocessing, Proceedings of AAAI'96, pp.202-208, 1996.

E. C. Freuder and P. D. Hubbe, Using inferred disjunctive constraints to decompose constraint satisfaction problems, Proceedings of IJCAI'93, pp.254-261, 1993.

G. Gallo and G. Urbani, Algorithms for testing the satisfiability of propositional formulae, The Journal of Logic Programming, vol.7, issue.1, pp.45-61, 1989.
DOI : 10.1016/0743-1066(89)90009-5

G. Katsirelos and F. Bacchus, Generalized nogoods in CSPs, Proceedings of AAAI'05, pp.390-396, 2005.

C. Lecoutre, Constraint networks: techniques and algorithms, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00870016

C. Lecoutre and F. Hemery, A study of residual supports in arc consistency, Proceedings of IJCAI'07, pp.125-130, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261267

C. Lecoutre, L. Sais, S. Tabary, and V. Vidal, Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance, Proceedings of CP'07, pp.453-467, 2007.
DOI : 10.1007/978-3-540-74970-7_33
URL : https://hal.archives-ouvertes.fr/hal-00383824

A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-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

P. W. Purdom, Solving Satisfiability with Less Searching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.6, issue.4, pp.510-513, 1984.
DOI : 10.1109/TPAMI.1984.4767555

I. Razgon and A. Meisels, A CSP Search Algorithm with Responsibility Sets and Kernels, Constraints, vol.10, issue.1, pp.151-177, 2007.
DOI : 10.1007/s10601-007-9016-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.9755

D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of CP'94, pp.10-20, 1994.
DOI : 10.1007/3-540-58601-6_86