Quantified constraints under perturbation
Journal of Symbolic Computation
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
Journal of Automated Reasoning
Beyond NP: Arc-Consistency for Quantified Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Backjumping for quantified Boolean logic satisfiability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A solver for quantified Boolean and linear constraints
Proceedings of the 2007 ACM symposium on Applied computing
Solving quantified constraint satisfaction problems
Artificial Intelligence
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
Variable Dependencies of Quantified CSPs
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Value ordering for quantified CSPs
Constraints
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic (TOCL)
The complexity of constraint satisfaction games and QCSP
Information and Computation
CSP properties for quantified constraints: definitions and complexity
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Quantified constraint satisfaction problems: from relaxations to explanations
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Solution directed backjumping for QCSP
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Reusing CSP propagators for QCSPs
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Realtime online solving of quantified CSPs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Set based robust design of mechanical systems using the quantifier constraint satisfaction algorithm
Engineering Applications of Artificial Intelligence
Beyond QCSP for solving control problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
BlockSolve: a bottom-up approach for solving quantified CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Relaxations and explanations for quantified constraint satisfaction problems
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Real-time solving of quantified CSPs based on Monte-Carlo game tree search
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Consistencies for ultra-weak solutions in minimax weighted CSPs using the duality principle
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of the CSP in which some variables are universally quantified. It has been shown that a solver based on an encoding of QCSP into QBF can outperform the existing direct QCSP approaches by several orders of magnitude. In this paper we introduce an efficient QCSP solver. We show how knowledge learned from the successful encoding of QCSP into QBF can be utilized to enhance the existing QCSP techniques and speed up search by orders of magnitude. We also show how the performance of the solver can be further enhanced by incorporating advanced look-back techniques such as CBJ and solution-directed pruning. Experiments demonstrate that our solver is several orders of magnitude faster than existing direct approaches to QCSP solving, and significantly outperforms approaches based on encoding QCSPs as QBFs.