: A Bottom-Up Approach for Solving Quantified CSPs

@inproceedings{Verger2006AB,
  title={: A Bottom-Up Approach for Solving Quantified CSPs},
  author={Guillaume Verger and Christian Bessiere},
  booktitle={CP},
  year={2006}
}
Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard CSP formalism. This is only recently that the constraint community got interested in QCSP and proposed algorithms to solve it. In this paper we propose BlockSolve, an algorithm for solving… CONTINUE READING