F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of the 16th European Conference on Artificial Intelligence ? ECAI, pp.146-150, 2004.

S. Gay, R. Hartert, C. Lecoutre, and P. Schaus, Conflict Ordering Search for Scheduling Problems, Principles and Practice of Constraint Programming ? CP, pp.140-148, 2015.
DOI : 10.1007/978-3-319-23219-5_10
URL : https://www.info.ucl.ac.be/%7Epschaus/assets/publi/cp2015_cos.pdf

D. Grimes and R. J. Wallace, Sampling Strategies and Variable Selection in Weighted Degree Heuristics, Principles and Practice of Constraint Programming ? CP, pp.831-838, 2007.
DOI : 10.1007/978-3-540-74970-7_61

M. Robert, G. L. Haralick, and . Elliott, Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Proceedings of the 6th International Joint Conference on Artificial Intelligence ? IJCAI, pp.356-364, 1979.

E. Hebrard, Mistral, a Constraint Satisfaction Library, Proceedings of the CP-08 Third International CSP Solvers Competition, pp.31-40, 2008.

R. Bayardo, J. , and R. C. Schrag, Using CSP Look-Back Techniques to Solve Real-World SAT Instances, Proceedings of the 14th National Conference on Artificial Intelligence ? AAAI, pp.203-208, 1997.
DOI : 10.1007/3-540-61551-2_65
URL : http://www.bayardo.org/ps/cp96.pdf

C. Lecoutre, L. Sas, S. Tabary, and V. Vidal, Reasoning from last conflict(s) in constraint programming, Artificial Intelligence, vol.173, issue.18, pp.1592-1614, 2009.
DOI : 10.1016/j.artint.2009.09.002
URL : https://hal.archives-ouvertes.fr/hal-00868108

A. Lopez-ortiz, C. Quimper, J. Tromp, and P. Van-beek, A fast and simple algorithm for bounds consistency of the alldifferent constraint, Proceedings of the 18th International Joint Conference on AI ? IJCAI, pp.245-250, 2003.

L. Michel and P. Van-hentenryck, Activity-Based Search for Black-Box Constraint Programming Solvers, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems ? CPAIOR 2012, pp.228-243, 2012.
DOI : 10.1007/978-3-642-29828-8_15
URL : https://www.researchgate.net/profile/Laurent_Michel3/publication/220481061_Activity-Based_Search_for_Black-Box_Contraint-Programming_Solvers/links/0c96051c30af4338c9000000.pdf

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

P. Refalo, Impact-Based Search Strategies for Constraint Programming, Principles and Practice of Constraint Programming ? CP, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41
URL : http://www.crt.umontreal.ca/~pesant/BIRS/pesant-IBS.pdf

T. Schiex and G. Verfaillie, Nogood Recording for Static and Dynamic Constraint Satisfaction Problems, ICTAI, pp.48-55, 1993.

P. M. João, K. A. Silva, and . Sakallah, GRASP -a New Search Algorithm for Satisfiability, Proceedings of the IEEE/ACM International Conference on Computer-aided Design ? ICCAD, pp.220-227, 1996.

P. M. João, K. A. Silva, and . Sakallah, GRASP: a search algorithm for propositional satisfiability. Computers, IEEE Transactions on, vol.48, issue.5, pp.506-521, 1999.

J. Peter, T. Stuckey, A. Feydy, G. Schutt, J. Tack et al., The minizinc challenge 2008-2013, pp.55-60, 2014.

J. Richard, D. Wallace, and . Grimes, Experimental studies of variable selection strategies based on constraint weights, Journal of Algorithms, vol.63, issue.1, pp.114-129, 2008.