F. Bacchus, Enhancing davis putnam with extended binary clause reasoning, AAAI, 2002.

A. Biere, E. Clarke, R. Raimi, and Y. Zhu, Verifying Safety Properties of a PowerPC??? Microprocessor Using Symbolic Model Checking without BDDs, International Conference on Computer-Aided Verification (CAV'99), volume 1633 of Lecture Notes in Computer Science, pp.60-72, 1999.
DOI : 10.1007/3-540-48683-6_8

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

G. Dequen and O. Dubois, kcnfs: An Efficient Solver for Random k-SAT Formulae, International Conference on Theory and Applications of Satisfiability Testing (SAT), Selected Revised Papers, pp.486-501, 2003.
DOI : 10.1007/978-3-540-24605-3_36
URL : https://hal.archives-ouvertes.fr/hal-00845688

O. Dubois, P. André, Y. Boufkhad, and J. Carlier, Sat versus unsat, Second DIMACS Challenge, pp.415-436, 1996.

E. Grégoire, B. Mazure, R. Ostrowski, and L. Sais, Automatic Extraction of Functional Dependencies, SAT'04, 2004.
DOI : 10.1007/11527695_10

H. Kautz and B. Selman, Planning as satisfiability, ECAI'92, pp.359-363, 1992.

T. Larrabee, Test pattern generation using Boolean satisfiability, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.11, issue.1, pp.4-15, 1992.
DOI : 10.1109/43.108614
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.6563

C. M. Li and A. , Heuristics based on unit propagation for satisfiability problems, IJCAI'97, pp.366-371, 1997.

J. P. Silva and K. A. Sakallah, Grasp -a new search algorithm for satisfiability, CAD'96, 1996.

J. P. Silva and K. A. Sakallah, Boolean satisfiability in electronic design automation, DAC'00, 2000.

L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, Efficient conflict driven learning in a boolean satisfiability solver, ICCAD'01, pp.279-285, 2001.