F. Aloul, I. Lynce, and S. Prestwich, Symmetry breaking in local search for unsatisfiability, 7th International Workshop on Symmetry and Constraint Satisfaction Problems, pp.9-13, 2007.

G. Audemard and L. Simon, Gunsat : A greedy local search algorithm for unsatisfiability, IJCAI, pp.2256-2261, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00438054

J. N. Bès and P. Jégou, Proving graph un-colorability with a consistency check of CSP, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), pp.693-694, 2005.
DOI : 10.1109/ICTAI.2005.102

D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.
DOI : 10.1145/359094.359101

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

W. K. Daya-ram-gaur, W. S. Jackson, and . Havens, Detecting unsatisfiable csps by coloring the micro-structure, AAAI/IAAI, pp.215-220, 1997.

E. Goldberg, Proving unsatisfiability of CNFs locally, Electronic Notes in Discrete Mathematics, vol.9, issue.5, pp.417-434, 2002.
DOI : 10.1016/S1571-0653(04)00316-6

H. Holger, T. Hoos, and . Stützle, Stochastic Local Search : Foundations & Applications, 2004.

P. Jégou, Decomposition of domains based on the micro-structure of finite constraint satisfaction problems, Proceedings AAAI'93, 1993.

E. De-klerk, H. Van-maaren, and J. P. Warners, Relaxations of the satisfiability problem using semidefinite programming, Journal of Automated Reasoning, vol.24, issue.1/2, pp.37-65, 2000.
DOI : 10.1023/A:1006362203438

S. Prestwich and I. Lynce, Local Search for Unsatisfiability, 9th International Conference on Theory and Applications of Satisfiability Testing, pp.283-296, 2006.
DOI : 10.1007/11814948_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.5731

]. Régin, A filtering algorithm for constraints of difference in csps, AAAI '94 : Proceedings of the twelfth national conference on Artificial intelligence, pp.362-367, 1994.

B. Selman, H. A. Kautz, and D. A. Mcallester, Ten challenges in propositional reasoning and search, IJCAI, pp.50-54, 1997.

B. Selman, H. J. Levesque, and D. G. Mitchell, A new method for solving hard satisfiability problems, AAAI, pp.440-446, 1992.