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

G. Pan and M. Vardi, Symbolic Decision Procedures for QBF, Proceedings CP'04, pp.453-467, 2004.
DOI : 10.1007/978-3-540-30201-8_34

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

L. Bordeaux and E. Montfroy, Beyond NP: Arc-Consistency 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=

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

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

R. Haralick and G. 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

H. Fargier, J. Lang, and T. Schiex, Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge, Proceedings AAAI'96, pp.175-180, 1996.

E. Freuder and P. Hubbe, Extracting constraint satisfaction subproblems, Proceedings IJCAI'95, pp.548-557, 1995.

. Choco, A Java library for constraint satisfaction problems, constraint programming and explanation-based constraint solving, 2005.