R. Krzysztof and . Apt, Principles of constraint programming, 2003.

E. Ben-sasson, R. Impagliazzo, ?. , A. Wigderson, and ?. , Near optimal separation of tree-like and general resolution, Combinatorica, vol.24, issue.4, pp.585-603, 2004.

G. Glorian, F. Boussemart, J. Lagniez, C. Lecoutre, and B. Mazure, Combining nogoods in restart-based search, Principles and Practice of Constraint Programming, pp.129-138, 2017.
DOI : 10.1007/978-3-319-66158-2_9

E. Goldberg and Y. Novikov, Verification of proofs of unsatisfiability for cnf formulas, Proceedings of the Conference on Design, Automation and Test in Europe, vol.1, p.10886, 2003.
DOI : 10.1109/date.2003.1253718
URL : http://eigold.tripod.com/papers/proof_verif.pdf

C. P. Gomes, B. Selman, and H. Kautz, Boosting combinatorial search through randomization, Proceedings of the Fifteenth National/Tenth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence, AAAI '98/IAAI '98, pp.431-437, 1998.

M. Heule and A. Biere, Proofs for satisfiability problems, Mathematical Logic and Foundations, vol.55, pp.1-22, 2015.

H. Katebi, A. Karem, J. Sakallah, and . Silva, Empirical study of the anatomy of modern sat solvers, SAT, 2011.

K. Pipatsrisawat and A. Darwiche, On the power of clause-learning sat solvers as resolution engines, Artificial Intelligence, vol.175, issue.2, pp.512-525, 2011.

C. Sinz and M. Iser, Problem-sensitive restart heuristics for the dpll procedure, Theory and Applications of Satisfiability Testing-SAT 2009, pp.356-362, 2009.
DOI : 10.1007/978-3-642-02777-2_33