F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of ECAI'04, pp.146-150, 2004.

H. Cambazard and N. Jussien, Identifying and exploiting problem structures using explanation-based constraint programming, Constraints, 2006.
DOI : 10.1007/11493853_9
URL : https://hal.archives-ouvertes.fr/hal-00869105

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

F. Focacci, F. Laburthe, and A. Lodi, Local search and constraint programming, 2001.
DOI : 10.1007/978-1-4419-8917-8_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.4401

P. Galinier and J. K. Hao, Tabu search for maximal constraint satisfaction problems, Proceedings of CP'97, pp.196-208, 1997.
DOI : 10.1007/BFb0017440

P. Galinier and J. K. Hao, A General Approach for Constraint Solving by Local Search, Journal of Mathematical Modelling and Algorithms, vol.3, issue.1, pp.73-88, 2004.
DOI : 10.1023/B:JMMA.0000026709.24659.da

C. P. Gomes, B. Selman, N. Crato, and H. Kautz, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, Journal of Automated Reasoning, vol.24, issue.1/2, pp.67-100, 2000.
DOI : 10.1023/A:1006314320276

T. Hulubei and B. O. Sullivan, Search Heuristics and Heavy-Tailed Behaviour, Proceedings of CP'05, pp.328-342, 2005.
DOI : 10.1007/11564751_26

J. Hwang and D. G. Mitchell, 2-way vs d-way branching for CSP, Proceedings of CP'05, pp.343-357, 2005.

N. Jussien and O. Lhomme, Local search with constraint propagation and??conflict-based heuristics, Seventh National Conference on Artificial Intelligence ? AAAI'2000, pp.169-174, 2000.
DOI : 10.1016/S0004-3702(02)00221-7
URL : https://hal.archives-ouvertes.fr/hal-00869124

C. Lecoutre, F. Boussemart, and F. Hemery, Backjump-based techniques versus conflict-directed heuristics, 16th IEEE International Conference on Tools with Artificial Intelligence, pp.549-557, 2004.
DOI : 10.1109/ICTAI.2004.37

C. Lecoutre and F. Hemery, A study of residual supports in arc consistency, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'2007), pp.125-130, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261267

C. Lecoutre, L. Sais, S. Tabary, and V. Vidal, Nogood recording from restarts, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'2007), 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261264

B. Mazure, L. Sais, and E. Gregoire, Boosting complete techniques thanks to local search methods, Annals of Mathematics and Artificial Intelligence, vol.22, issue.3/4, pp.319-331, 1998.
DOI : 10.1023/A:1018999721141

S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence, vol.58, issue.1-3, pp.1-3161, 1992.
DOI : 10.1016/0004-3702(92)90007-K

P. Morris, The breakout method for escaping from local minima, Proceedings of AAAI'93, pp.40-45, 1993.

S. Prestwich, Local search and backtracking versus non-systematic backtracking The American Association for Artificial Intelligence, Papers from the AAAI 2001 Fall Symposium on Using Uncertainty Within Computation, pp.109-115, 2001.

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

A. Schaerf, Combining local search and look-ahead for scheduling and constraint satisfaction problems Ten challenges in propositional reasoning and search, Proceedings of IJCAI'97 Proc. IJCAI'97, pp.1254-1259, 1997.

B. Selman, H. Levesque, and D. Mitchell, A new method for solving hard satisfiability problems, Proceedings of the Tenth National Conference on Artificial Intelligence, pp.440-446, 1992.

K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, A simple model to generate hard satisfiable instances, Proceedings of IJCAI'05, pp.337-342, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00396466