S. Akers, Binary Decision Diagrams, IEEE Transactions on Computers, vol.27, issue.6, pp.509-516, 1978.
DOI : 10.1109/TC.1978.1675141

G. Audemard and L. Sais, SAT based BDD solver for quantified Boolean formulas, 16th IEEE International Conference on Tools with Artificial Intelligence, pp.82-89, 2004.
DOI : 10.1109/ICTAI.2004.106

L. Daniel-le-berre, A. Simon, and . Tachella, Challenges in the qbf arena : the sat'03 evaluation of qbf solvers, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), LNAI, pp.452-467, 2003.

A. Biere, Resolve and Expand, Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), 2004.
DOI : 10.1007/11527695_5

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-692
DOI : 10.1109/TC.1986.1676819
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.4027

M. Cadoli, A. Giovanardi, and M. Schaerf, An algorithm to evaluate quantified boolean formulae, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pp.262-267, 1998.

H. Sylvie-coste-marquis, J. Fargier, D. L. Lang, P. Berre, and . Marquis, Résolution de formules booléennes quantifiées : problèmes et algorithmes, Actes du 13eme congrès AFRIF-AFIA Reconnaissance des forme et intelligence artificielle (RFIA), pp.289-298, 2002.

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

O. Dubois and G. Dequen, A backbonesearch heuristic for efficient solving of hard 3?sat formulae, Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI?01), 2001.

N. Eén and N. Sörensson, An extensible sat solver, Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, pp.502-508, 2003.

I. P. Gent, H. Holger, A. G. Hoos, K. Rowley, and . Smyth, Using Stochastic Local Search to Solve Quantified Boolean Formulae, Proceedings of the 9th international conference of principles and practice of constraint programming, pp.348-362, 2003.
DOI : 10.1007/978-3-540-45193-8_24

E. Giunchiglia, M. Narizzano, and A. Tacchella, QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability, Proceedings of the International Joint Conference on Automated Reasoning (IJCAR'01), 2001.
DOI : 10.1007/3-540-45744-5_27

R. Letz, Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas, Proceedings of Tableaux 2002, pp.160-175, 2002.
DOI : 10.1007/3-540-45616-3_12

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

D. Ranjan, D. Tang, and S. M. Niklas, A Comparative Study of 2QBF Algorithms, Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2004.

J. Rintanen, Partial implicit unfolding in the Davis-Putnam procedure for Quantified Boolean For- mulae, Proceedings of the First International Conference on Quantified Boolean Formulae (QBF'01), pp.84-93, 2001.

B. Selman, H. Levesque, and D. Mitchell, A new method for solving hard satisfiability problems, Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92), pp.459-465, 1992.

L. Zhang and S. Malik, Towards a symetric treatment of satisfaction and conflicts in quantified boolean formula evaluation, Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, pp.200-215, 2002.