F. Bacchus, Extending Forward Checking, Proceedings of CP'00, pp.35-51, 2000.
DOI : 10.1007/3-540-45349-0_5

R. J. Bayardo and R. C. Shrag, Using CSP look-back techniques to solve real-world SAT instances, Proceedings of AAAI'97, pp.203-208, 1997.

C. Bessière and J. Régin, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Proceedings of CP'96, pp.61-75, 1996.
DOI : 10.1007/3-540-61551-2_66

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

F. Boussemart, F. Hemery, and C. Lecoutre, Description and representation of the problems selected for the first international constraint satisfaction problem solver competition, Proceedings of CPAI'05 workshop held with CP'05, pp.7-26, 2005.

D. Brelaz, 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

X. Chen and P. Van-beek, Conflict-directed backjumping revisited, Journal of Artificial Intelligence Research, vol.14, pp.53-81, 2001.

R. Debruyne and C. Bessière, Some practical filtering techniques for the constraint satisfaction problem, Proceedings of IJCAI'97, pp.412-417, 1997.

R. Dechter, Constraint processing, 2003.

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

J. Gaschnig, Performance measurement and analysis of search algorithms, 1979.

M. Ginsberg, Dynamic backtracking, Artificial Intelligence, vol.1, pp.25-46, 1993.

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

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.

U. Junker, QuickXplain: preferred explanations and relaxations for over-constrained problems, Proceedings of AAAI'04, pp.167-172, 2004.

N. Jussien, R. Debruyne, and P. Boizumault, Maintaining Arc-Consistency within Dynamic Backtracking, Proceedings of CP'00, pp.249-261, 2000.
DOI : 10.1007/3-540-45349-0_19
URL : https://hal.archives-ouvertes.fr/hal-00869126

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

C. Lecoutre, F. Boussemart, and F. Hemery, Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms, Proceedings of CP'03, pp.480-494, 2003.
DOI : 10.1007/978-3-540-45193-8_33

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

O. Lhomme, Quick shaving, Proceedings of AAAI'05, pp.411-415, 2005.

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

A. K. Mackworth and E. C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, vol.25, issue.1, pp.65-74, 1985.
DOI : 10.1016/0004-3702(85)90041-4

P. Prosser, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, vol.1, issue.4, pp.268-299, 1993.
DOI : 10.1016/0004-3702(77)90007-8

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

L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik, Efficient conflict driven learning in a Boolean satisfiability solver, Proceedings of IC- CAD'01, pp.279-285, 2001.