Name
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.
|
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11889205_45 | CP |
Keywords | Field | DocType |
bottom up | Mathematical optimization,Computer science,Top-down and bottom-up design,Constraint satisfaction dual problem | Conference |
Citations | PageRank | References |
2 | 0.37 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillaume Verger | 1 | 17 | 1.67 |
| Christian Bessière | 2 | 88 | 6.27 |