G. Audemard and L. Sais, A Symbolic Search Based Approach for Quantified Boolean Formulas, Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT'05), 2005.
DOI : 10.1007/11499107_2
URL : https://hal.archives-ouvertes.fr/hal-00014621

A. Ayari and D. Basin, Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers, Formal Methods in Computer- Aided Design, Fourth International Conference, 2002.
DOI : 10.1007/3-540-36126-X_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.2608

M. Benedetti, sKizzo: A Suite to Evaluate and Certify QBFs, Proceedings of the 20th International Conference on Automated Deduction (CADE'05), pp.369-376, 2005.
DOI : 10.1007/11532231_27

M. Benedetti and H. Mangassarian, Experience and Perspectives in QBF-Based Formal Verification, Journal on Satisfiability Boolean Modeling and Computation, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00466766

A. Biere, Resolve and Expand, Proceedings of the 7th International Confrerence on Theory and Applications of Satisfiability Testing (SAT'04), pp.59-70, 2004.
DOI : 10.1007/11527695_5

M. Cadoli, A. Giovanardi, and M. Schaerf, Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae, Proceedings of the 5th Conference of the Italian Association for Artificial Intelligence (AIIA'97), pp.207-218, 1997.
DOI : 10.1007/3-540-63576-9_109

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communication of the ACM, vol.5, 1962.

M. Davis and H. Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.
DOI : 10.1145/321033.321034

U. Egly, M. Seidl, and S. Woltran, A Solver for QBFs in Nonprenex Form, Proceedings of the 17th European Conference on Artificial Intelligence (ECAI'06), pp.477-481, 2006.

R. Feldmann, B. Monien, and S. Schamberger, A Distributed Algorithm to Evaluate Quantified Boolean Formulae, Proceedings of the 17th National Conference on Artificial Intelligence (AAAI'00) and 12th Conference on Innovative Applications of Artificial Intelligence (IAAI'00), 2000.

E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns -Elements of Reusable Object- Oriented Software, 1994.

I. P. Gent, H. H. Hoos, A. G. Rowley, and K. Smyth, Unsing Stochastic Local Search to Solve Quantified Boolean Formulae, Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, 2003.

E. Giunchiglia, M. Narizzano, and A. Tacchella, Quantified Boolean Formulas satisfiability library
DOI : 10.1007/3-540-45744-5_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.5018

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

H. K. Büning, M. Karpinski, and A. Flögel, Resolution for Quantified Boolean Formulas, Information and Computation, vol.117, issue.1, pp.12-18, 1995.
DOI : 10.1006/inco.1995.1025

H. , K. Büning, and X. Zhao, On Models for Quantified Boolean Formulas, Logic versus Approximation, 2004.

M. Lewis, P. Marin, T. Schubert, M. Narizzano, B. Becker et al., PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing, Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT'09), pp.509-523, 2009.
DOI : 10.1016/0167-8191(96)00024-5

M. Lewis, T. Schubert, and B. Becker, QMiraXT -A Multithreaded QBF Solver, Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV'09), pp.7-16, 2009.

F. Lonsing and A. Biere, Nenofex: Expanding NNF for QBF Solving, Proceedings of the Eleventh International Conference on Theory and Applications of Satisfiability Testing (SAT'08), pp.196-210, 2008.
DOI : 10.1007/978-3-540-79719-7_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.334.8299

A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, 13th Annual Symposium on Switching and Automata Theory (swat 1972), pp.125-129, 1972.
DOI : 10.1109/SWAT.1972.29

D. A. Plaisted, A. Biere, and Y. Zhu, A satisfiability procedure for quantified Boolean formulae, Discrete Applied Mathematics, vol.130, issue.2, pp.291-328, 2003.
DOI : 10.1016/S0166-218X(02)00409-2

J. Rintanen, Constructing conditional plans by a theorem-prover, Journal of Artificial Intelligence Research, vol.10, pp.323-352, 1999.

J. Rintanen, Improvements to the Evaluation of Quantified Boolean Formulae, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99), pp.1192-1197, 1999.

T. Schubert, M. Lewis, and B. Becker, PaMiraXT : Parallel SAT Solving with Threads and Message Passing, Journal on Satisfiability Boolean Modeling and Computation, vol.6, pp.203-222, 2009.

B. Selman, H. A. Kautz, and B. Cohen, Local search strategies for satisfiability testing, DI- MACS Series in Discrete Mathematics and Theoretical Computer Science, pp.521-532, 1993.

M. Snir, S. Otto, D. Walker, J. Dongarra, and S. Huss-lederman, MPI : The Complete Reference, 1995.

I. Stéphan, B. D. Mota, and P. Nicolas, From (Quantified) Boolean Formulae to Answer Set Programming, Journal of Logic and Computation, vol.19, issue.4, pp.565-590, 2009.
DOI : 10.1093/logcom/exn041

L. J. Stockmeyer, The polynomial-time hierarchy, Theoretical Computer Science, vol.3, issue.1, pp.1-22, 1977.
DOI : 10.1016/0304-3975(76)90061-X
URL : http://doi.org/10.1016/0304-3975(76)90061-x

L. Zhang and S. Malik, Conflict driven learning in a quantified Boolean Satisfiability solver, Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design , ICCAD '02, 2002.
DOI : 10.1145/774572.774637