C. Ansótegui, C. Gomes, and B. Selman, The Achilles' Heel of QBF, Proc. of AAAI, 2005.

K. R. Apt, The essence of constraint propagation, Theoretical Computer Science, vol.221, issue.1-2, pp.179-210, 1999.
DOI : 10.1016/S0304-3975(99)00032-8

M. Benedetti, A. Lallouet, and J. Vautard, Problem Modeling and Solving in QCSP made Practical, 2006.

M. Benedetti, A. Lallouet, and J. Vautard, Reusing CSP Propagators for QCSPs, Proc. of the Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (CSCLP-06), Portugal, 2006.
DOI : 10.1007/978-3-540-73817-6_4
URL : https://hal.archives-ouvertes.fr/hal-00085494

M. Benedetti, A. Lallouet, and J. Vautard, QeCode's web page, www.univ-orleans.fr/lifo/members, 2006.

G. and C. Bessiere, Blocksolve : une approche bottom-up des QCSP, Proc. of JFPC'06, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00085794

M. Benedetti, Evaluating QBFs via Symbolic Skolemization, Proc. of LPAR'04, 2005.
DOI : 10.1007/978-3-540-32275-7_20

M. Benedetti, Abstract Branching for Quantified Formulas, Proc. of AAAI, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00466744

C. Bessiere and G. Verger, Strategic constraint satisfaction problems, Proc. of CP'06 Workshop on Modelling and Reformulation, 2006.
URL : https://hal.archives-ouvertes.fr/lirmm-00134937

A. Biere, Resolve and Expand, Proc. of SAT, 2004.
DOI : 10.1007/11527695_5

L. Bordeaux and E. Monfroy, Beyond NP: Arc-Consistency for Quantified Constraints, Proc. of CP, 2002.
DOI : 10.1007/3-540-46135-3_25

L. Bordeaux, Boolean and Interval Propagation for Quantified Constraints, Proc. of Workshop on Quantification in Constraint Programming, 2005.

M. Cadoli, T. Eiter, and G. Gottlob, Default logic as a query language, IEEE Transactions on Knowledge and Data Engineering, vol.9, issue.3, pp.448-463, 1997.
DOI : 10.1109/69.599933

I. P. Gent and A. G. Rowley, Encoding Connect-4 using Quantified Boolean Formulae, Proc. of 2 nd Int. Workshop on Modelling and Reformulating CSPs, 2003.

I. P. Gent, P. Nightingale, and A. Rowley, Encoding quantified CSPs as Quantified Boolean Formulae, Proc. of ECAI, 2004.

I. P. Gent, P. Nightingale, and K. Stergiou, QCSP-Solve : A solver for quantified constraint satisfaction problems, Proc. of IJCAI, 2005.

I. P. Gent, C. Jefferson, and I. Miguel, Minion : Lean, Fast Constraint Solving, Proc. of ECAI, 2006.

E. Giunchiglia, M. Narizzano, and A. Tacchella, Quantified Boolean Formula library, www.qbflib.org, 2001.

H. A. Kautz and B. Selman, Planning as satisfiability, Proc. of ECAI, 1992.

P. Nightingale, Consistency for Quantified Constraint Satisfaction Problems, Proc. of CP, 2005.
DOI : 10.1007/11564751_66

D. A. Plaisted and S. Greenbaum, A Structure-preserving Clause Form Translation, Journal of Symbolic Computation, vol.2, issue.3, pp.293-304, 1986.
DOI : 10.1016/S0747-7171(86)80028-1

C. Schulte and G. Tack, Views and iterators for generic constraint implementations, Proc. of CP, 2005.

L. Zhang, Solving QBF with Combined Conjunctive and Disjunctive Normal Form, Proc. of AAAI, 2006.