BlockSolve: a bottom-up approach for solving quantified CSPs

Authors:
Guillaume Verger;Christian Bessiere
Affiliations:
LIRMM, CNRS/University of Montpellier, France;LIRMM, CNRS/University of Montpellier, France
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 5
Cited 7

Beyond NP: Arc-Consistency for Quantified Constraints

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Extracting constraint satisfaction subproblems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
QCSP-solve: a solver for quantified constraint satisfaction problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Solving quantified constraint satisfaction problems

Artificial Intelligence
Value ordering for quantified CSPs

Constraints
Generalizing consistency and other constraint properties to quantified constraints

ACM Transactions on Computational Logic (TOCL)
Non-binary quantified CSP: algorithms and modelling

Constraints
Solution directed backjumping for QCSP

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint programming approach to a bilevel scheduling problem

Constraints
Beyond QCSP for solving control problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.