Skip to Main content Skip to Navigation
Conference papers

Blocksolve: A bottom-up approach for solving quantified CSPs

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00135534
Contributor : Christian Bessiere <>
Submitted on : Thursday, March 8, 2007 - 10:41:51 AM
Last modification on : Thursday, May 14, 2020 - 6:58:06 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 9:38:20 PM

Identifiers

Collections

Citation

Guillaume Verger, Christian Bessière. Blocksolve: A bottom-up approach for solving quantified CSPs. CP: Principles and Practice of Constraint Programming, Sep 2006, Nantes, France. pp.635-649, ⟨10.1007/11889205_45⟩. ⟨lirmm-00135534⟩

Share

Metrics

Record views

199

Files downloads

197