M. Benedetti, sKizzo: A Suite to Evaluate and Certify QBFs, Proceedings of the 20th International Conference on Automated Deduction (CADE05), 2005.
DOI : 10.1007/11532231_27

L. Bordeaux, Boolean and interval propagation for quantified constraints, First International Workshop on Quantification in Constraint Programming, 2005.

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

H. K. Büning, K. Subramani, and X. Zhao, Boolean Functions as Models for Quantified Boolean Formulas, Journal of Automated Reasoning, vol.3, issue.1, pp.49-75, 2007.
DOI : 10.1007/s10817-007-9067-0

S. Coste-marquis, H. Fargier, J. Lang, D. L. Berre, and P. Marquis, Representing policies for quantified boolean formulae, Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR'06), pp.286-296, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00121155

A. Darwiche and P. Marquis, A knowledge compilation map, Journal of Artificial Intelligence Research, vol.17, pp.229-264, 2002.

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

E. Giunchiglia, M. Narizzano, and A. Tacchella, Clause/term resolution and learning in the evaluation of quantified boolean formulas, Journal of Artificial Intelligence Research, vol.26, pp.371-416, 2007.

F. Somenzi, CUDD : CU decision diagram package release 2.3.0. university of colorado at boulder, 1998.

I. Stéphan, Algorithmes d'´ elimination de quantificateurs pour le calcul des politiques des formules booléennes quantifiées, 2005.

I. Stéphan, Finding models for quantified boolean formulae, First International Workshop on Quantification in Constraint Programming, 2005.

I. Stéphan, Boolean propagation based on literals for quantified boolean formulae, 17th European Conference on Artificial Intelligence, 2006.