M. Benedetti, A. Lallouet, and J. Vautard, QCSP Made Practical by Virtue of Restricted Quantification, Proc. of IJCAI-07, pp.38-43, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00144921

P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso, Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking, Proc. of IJCAI-01, pp.473-478, 2001.

L. Bordeaux and E. Monfroy, Beyond NP : Arcconsistency for Quantified Constraints, Proc. of CP-02, pp.371-386, 2002.
DOI : 10.1007/3-540-46135-3_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3314

I. P. Gent, P. Nightingale, and A. Rowley, Encoding Quantified CSPs as Quantified Boolean Formulae, Proc. of ECAI-04, pp.176-180, 2004.

I. P. Gent, P. Nightingale, and K. Stergiou, QCSP-Solve : A Solver for Quantified Constraint Satisfaction Problems, Proc. of IJCAI-05, pp.138-143, 2005.

H. Kautz and B. Selman, Planning as Satisfiability, Proc. of ECAI-92, pp.359-363, 1992.

N. Mamoulis and K. Stergiou, Algorithms for Quantified Constraint Satisfaction Problems, Proc. of CP-04, pp.752-756, 2004.
DOI : 10.1007/978-3-540-30201-8_60
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1103

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.1780

N. Piterman, A. Pnueli, and Y. Sa, Synthesis of Reactive(1) Designs, Proc. of the 7th International Conference on Verification, Model Checking and Abstract Interpretation, pp.364-380, 2006.
DOI : 10.1007/11609773_24

C. Pralet, G. Verfaillie, M. Lema??trelema??tre, and G. Infantes, Constraint-Based Controller Synthesis in Non- Deterministic and Partially Observable Domains, Proc. of ECAI-10, pp.681-686, 2010.

M. Puterman, Markov Decision Processes, Discrete Stochastic Dynamic Programming, 1994.

K. Stergiou, Repair-Based Methods for Quantified CSPs, Proc. of CP-05, pp.652-666, 2005.
DOI : 10.1007/11564751_48

G. Verger and C. Bessiere, BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
DOI : 10.1007/11889205_45
URL : https://hal.archives-ouvertes.fr/lirmm-00135534