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

L. Bordeaux and E. Montfroy, Beyond np : Arcconsistency for quantified constraints, Proceedings 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

H. Fargier, J. Lang, and T. Schiex, Mixed constraint satisfaction : A framework for decision problems under incomplete knowledge, AAAI/IAAI, pp.175-180, 1996.

C. Eugene, P. D. Freuder, and . Hubbe, Extracting constraint satisfaction subproblems, IJCAI, pp.548-557, 1995.

I. P. Gent, P. Nightingale, and K. Stergiou, QCSPsolve : A solver for quantified constraint satisfaction problems, Proceedings IJCAI'05, pp.138-143, 2005.

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

N. Mamoulis and K. Stergiou, Algorithms for Quantified Constraint Satisfaction Problems, Proceedings 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

G. Pan and M. Y. Vardi, Symbolic Decision Procedures for QBF, Lecture Notes in Computer Science, vol.3258, pp.453-467, 2004.
DOI : 10.1007/978-3-540-30201-8_34

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.200

D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings PPCP'94, 1994.
DOI : 10.1007/3-540-58601-6_86

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