B. Benhamou, L. Saïs, and P. Siegel, Two proof procedures for a cardinality based language in propositional calculus, Proc. of STACS, pp.71-82, 1994.
DOI : 10.1007/3-540-57785-8_132

H. Bennaceur, The satisfiability problem regarded as a constraint satisfaction problem, Proc. of ECAI 1996, pp.155-160, 1996.

H. Bennaceur, A Comparison between SAT and CSP Techniques, Constraints, vol.9, issue.2, pp.123-138, 2004.
DOI : 10.1023/B:CONS.0000024048.03454.c0
URL : https://hal.archives-ouvertes.fr/hal-00084900

T. Castell, Consistance et déduction en logique propositionnelle, Thèse de doctorat, 1997.

D. D. Edwards, Research summary Available from http, 1996.

I. P. Gent, P. Prosser, and T. Walsh, The extended literal encoding of SAT into CSP Available from http, APES Research Group, 2003.

I. P. Gent, Arc consistency in SAT, Proc. of ECAI 2002, pp.121-125, 2002.

A. Haken, The intractability of resolution, Theoretical Computer Science, vol.39, pp.297-308, 1985.
DOI : 10.1016/0304-3975(85)90144-6

A. Kean and G. Tsiknis, An incremental method for generating prime implicants/implicates, Journal of Symbolic Computation, vol.9, issue.2, pp.185-206, 1990.
DOI : 10.1016/S0747-7171(08)80029-6

B. Krishnamurthy, Short proofs for tricky formulas, Acta Informatica, vol.22, issue.3, pp.253-275, 1985.
DOI : 10.1007/BF00265682

D. , L. Berre, and L. Simon, The essentials of the SAT 2003 competition, Proc. SAT 2003, pp.452-467, 2003.

O. Roussel, . Ph, and . Mathieu, A new method for knowledge compilation: The achievement by cycle search, Proc. of CADE-13, pp.493-507, 1996.
DOI : 10.1007/3-540-61511-3_109
URL : https://hal.archives-ouvertes.fr/hal-00731971

O. Roussel, L'achèvement des bases de connaissances en calcul propositionnel et en calcul des prédicats, 1997.

P. Siegel, Représentation et utilisation de la connaissance en calcul propositionnel, Thèse d'Etat, 1987.

J. R. Slagle, C. L. Chang, and R. C. Lee, A New Algorithm for Generating Prime Im- plicants, IEEE Transactions on Computers, C, vol.19, issue.4, pp.304-310, 1970.