V. Allis, A knowledge-based approach of connect-four -the game is solved : White wins, 1988.

C. Ansótegui, C. P. Gomes, and B. Selman, The achilles' heel of qbf, AAAI, pp.275-281, 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

G. Audemard, S. Jabbour, and L. Saïs, Symmetry breaking in quantified boolean formulae, IJCAI'07 : Proceedings of the 20th international joint conference on Artifical intelligence, pp.2262-2267, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00438055

J. Audestad, A. A. Gaivoronski, and A. Werner, Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector, Annals of Operations Research, vol.36, issue.5, pp.19-39, 2006.
DOI : 10.1007/s10479-006-6159-x

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint-Based Scheduling. Operations Research and Management Science, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00123562

N. Beldiceanu and M. Carlsson, A New Multi-resource cumulatives Constraint with Negative Heights, CP, pp.63-79, 2002.
DOI : 10.1007/3-540-46135-3_5

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Global Constraint Catalogue: Past, Present and Future, Constraints, vol.2, issue.1, pp.21-62, 2007.
DOI : 10.1007/s10601-006-9010-8

M. Benedetti, Extracting certificates from quantified boolean formulas, International Joint Conference on Artificial Intelligence, pp.47-53, 2005.

M. Benedetti, sKizzo: A Suite to Evaluate and Certify QBFs, CADE, pp.369-376, 2005.
DOI : 10.1007/11532231_27

M. Benedetti, A. Lallouet, and J. Vautard, Reusing CSP Propagators for QCSPs, Joint Annual Workshop of the ERCIM Working Group on Constraints and the CoLogNET area on Constraint and Logic Programming, pp.201-215, 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, QCSP Made Practical by Virtue of Restricted Quantification, International Joint Conference on Artificial Intelligence, pp.38-43, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00144921

M. Benedetti, A. Lallouet, and J. Vautard, Quantified Constraint Optimization, Principles and Practice of Constraint Programming, 2008.
DOI : 10.1007/978-3-540-85958-1_31
URL : https://hal.archives-ouvertes.fr/hal-00466771

C. Bessière and G. Verger, Strategic constraint satisfaction problems, Workshop on Constraint Modelling and Reformulation, pp.17-29, 2006.

L. Bordeaux, Résolution de problèmes combinatoire modélisés par des contraintes quantifiées, 2003.

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

L. Bordeaux, M. Cadoli, and T. Mancini, CSP properties for quantified constraints : Definitions and complexity, National Conference on Artificial Intelligence, pp.360-365, 2005.

L. Bordeaux and E. Monfroy, Beyond NP: Arc-Consistency for Quantified Constraints, Principles and Practice of Constraint Programming, pp.371-386, 2002.
DOI : 10.1007/3-540-46135-3_25

M. Bouhtou, A. Grigoriev, S. Van-hoesel, A. F. Van-der-kraaij, C. R. Frits et al., Pricing bridges to cross a river, Naval Research Logistics, vol.49, issue.4, pp.411-420, 2007.
DOI : 10.1002/nav.20216

J. Bracken and J. Mcgill, Mathematical Programs with Optimization Problems in the Constraints, Operations Research, vol.21, issue.1, pp.37-44, 1973.
DOI : 10.1287/opre.21.1.37

T. Bylander, The computational complexity of propositional STRIPS planning, Artificial Intelligence, vol.69, issue.1-2, pp.165-204, 1994.
DOI : 10.1016/0004-3702(94)90081-7

Y. Caseau and F. Laburthe, Cumulative scheduling with task intervals, Joint International Conference and Symposium on Logic Programming, pp.363-377, 1996.

H. Chen, The Computational Complexity of Quantified Constraint Satisfaction, 2004.

H. Chen, Quantified constraint satisfaction and bounded treewidth, ECAI, pp.161-165, 2004.

H. Chen, Existentially restricted quantified constraint satisfaction, Information and Computation, vol.207, issue.3, pp.369-388, 2009.
DOI : 10.1016/j.ic.2008.11.001
URL : http://doi.org/10.1016/j.ic.2008.11.001

H. Chen and M. Pál, Optimization, Games, and Quantified Constraint Satisfaction, MFCS, pp.239-250, 2004.
DOI : 10.1007/978-3-540-28629-5_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.3893

B. Colson, P. Marcotte, and G. Savard, An overview of bilevel optimization, Annals of Operations Research, vol.89, issue.1, pp.235-256, 2007.
DOI : 10.1007/s10479-007-0176-2

A. Stephen and . Cook, The complexity of theorem-proving procedures, STOC '71 : Proceedings of the third annual ACM symposium on Theory of computing, pp.151-158, 1971.

V. Dalmau, Some dichotomy theorems on constant-free quantified boolean formulas, 1997.

S. Aviezri, D. Fraenkel, and . Lichtenstein, Computing a perfect strategy for n*n chess requires time exponential in n, Proceedings of the 8th Colloquium on Automata, Languages and Programming, pp.278-293, 1981.

G. Team and . Gecode, Generic constraint development environment Available from http, 2006.

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

I. P. Gent and T. Walsh, Csplib : a benchmark library for constraints Available from http, A shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming (CP-99), 1999.

E. Giunchiglia and A. Tacchella, QuBE++: An Efficient QBF Solver, Fifth International Conference on Formal Methods in Computer Aided Design, 2004.
DOI : 10.1007/978-3-540-30494-4_15

Y. Hamadi, S. Jabbour, and L. Sais, Manysat : a parallel sat solver, Journal on Satisfiability Boolean Modeling and Computation, JSAT, vol.6, pp.245-262, 2009.

S. Iwata and T. Kasai, The Othello game on an n ?? n board is PSPACE-complete, Theoretical Computer Science, vol.123, issue.2, pp.329-340, 1994.
DOI : 10.1016/0304-3975(94)90131-7

R. Kolisch, C. Schwindt, and A. Sprecher, Benchmark Instances for Project Scheduling Problems, 1998.
DOI : 10.1007/978-1-4615-5533-9_9

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

P. Nightingale, Consistency for Quantified Constraint Satisfaction Problems, CP, pp.792-796, 2005.
DOI : 10.1007/11564751_66

P. Nightingale, Consistency for Quantified Constraint Satisfaction Problems, 2007.
DOI : 10.1007/11564751_66

P. Nightingale, Non-binary quantified CSP: algorithms and modelling, Constraints, vol.12, issue.2, pp.539-581, 2009.
DOI : 10.1007/s10601-009-9068-1

C. H. Papadimitriou, Computational Complexity, 1994.

C. Pralet, A generic algebraic framework for representing and solving sequential decision making problems with uncertainties, feasibilities, and utilities, 2006.

J. C. Sokoban-is-pspace-complete, J. C. Culberson, and . Culberson, Sokoban is pspace-complete, 1997.

S. Reisch, Gobang is PSPACE-complete, Acta Informatica, vol.16, issue.1, pp.59-66, 1980.
DOI : 10.1007/BF00288536

J. M. Robson, Checkers is Exptime Complete, SIAM Journal on Computing, vol.13, issue.2, pp.252-267, 1984.
DOI : 10.1137/0213018

W. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems : Hard and easy problems, IJCAI (1), pp.631-639, 1995.

H. Stackelberg, Pricing and Equilibrium., Economica, vol.20, issue.80, 1952.
DOI : 10.2307/2550609

J. Larry and . Stockmeyer, The polynomial-time hierarchy, Theor. Comput. Sci, vol.3, issue.1, pp.1-22, 1976.

G. Verger, Des Quantificateurs dans les Réseaux de Contraintes, 2008.

G. Verger and C. Bessière, BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs, Twelfth International Conference on Principles and Practice of Constraint Programming, pp.635-649, 2006.
DOI : 10.1007/11889205_45
URL : https://hal.archives-ouvertes.fr/lirmm-00135534

G. Verger and C. Bessiere, Guiding Search in QCSP???+??? with Back-Propagation, CP, pp.175-189, 2008.
DOI : 10.1007/978-3-540-85958-1_12
URL : https://hal.archives-ouvertes.fr/lirmm-00329894

T. Walsh, Stochastic constraint programming, ECAI, pp.111-115, 2002.