P. Beame, H. Kautz, and A. Sabharwal, Towards understanding and harnessing the potential of clause learning, J. of Artificial Intelligence Research, vol.22, pp.319-351, 2004.

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

O. Dubois, P. André, Y. Boufkhad, and Y. Carlier, Second DIMACS implementation challenge : cliques, coloring and satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, chapter SAT vs. UNSAT, pp.415-436, 1996.

N. Eén and A. Biere, Effective preprocessing in SAT through variable and clause elimination, Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT'05), pp.61-75, 2005.

N. Eén and N. Sörensson, An extensible SAT-solver, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), pp.502-518, 2003.

N. Eén and N. Sörensson, An extensible sat-solver, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), 2002.

E. Goldberg and Y. Novikov, BerkMin : A fast and robust SAT-solver, Proceedings of International Conference on Design, Automation, and Test in Europe (DATE '02), pp.142-149, 2002.

C. M. Li and A. , Heuristics based on unit propagation for satisfiability problems, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), pp.366-371, 1997.

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

K. Pipatsrisawat and A. Darwiche, Rsat 2.0 : Sat solver description, 2007.