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 QCSPs that factorizes computations made in branches of the search tree. Instead of following the order of the variables in the quantification sequence, our technique searches for combinations of values for existential variables at the bottom of the tree that will work for (several) values of universal variables earlier in the sequence. An experimental study shows the good performance of BlockSolve compared to a state of the art QCSP solver. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Verger, G., & Bessiere, C. (2006). BlockSolve: A bottom-up approach for solving quantified CSPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4204 LNCS, pp. 635–649). Springer Verlag. https://doi.org/10.1007/11889205_45
Mendeley helps you to discover research relevant for your work.