Resolution for quantified Boolean formulas
Information and Computation
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Checking equivalence for partial implementations
Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Dependent and Independent Variables in Propositional Satisfiability
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Learning for quantified boolean logic satisfiability
Eighteenth national conference on Artificial intelligence
Quantifier structure in search based procedures for QBFs
Proceedings of the conference on Design, automation and test in Europe: Proceedings
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Bounded model checking with QBF
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A solver for quantified Boolean and linear constraints
Proceedings of the 2007 ACM symposium on Applied computing
A solver for QBFs in negation normal form
Constraints
A Unified Framework for Certificate and Compilation for QBF
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic (TOCL)
Beyond CNF: A Circuit-Based QBF Solver
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
QCSP made practical by virtue of restricted quantification
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Leveraging dominators for preprocessing QBF
Proceedings of the Conference on Design, Automation and Test in Europe
Exploiting structure in an AIG based QBF solver
Proceedings of the Conference on Design, Automation and Test in Europe
A non-prenex, non-clausal QBF solver with game-state learning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
QBF modeling: exploiting player symmetry for simplicity and efficiency
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Bridging the gap between dual propagation and CNF-based QBF solving
Proceedings of the Conference on Design, Automation and Test in Europe
Recovering and utilizing partial duality in QBF
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Similar to most state-of-the-art Boolean Satisfiabilily (SAT) solvers, all contemporary Quantified Boolean Formula (QBF) solvers require inputs to be in the Conjunctive Normal Form (CNF). Most of them also store the QBF in CNF internally for reasoning. In order to use these solvers, arbitrary Boolean formulas have to be transformed into equi-satisfiable formulas in Conjunctive Normal Form by introducing additional variables. In this paper, we point out an inherent limitation of this approach, namely the asymmetric treatment of satisfactions and conflicts. This deficiency leads to artificial increase of search space for QBF solving. To overcome the limitation, we propose to transform a Boolean formula into a combination of an equisatisfiable CNF formula and an equi-tautological DNF formula for QBF solving. QBF solvers based on this approach treat satisfactions and conflicts symmetrically, thus avoiding the exploration of unnecessary search space. A QBF solver called IQTest is implemented based on this idea. Exrerimental results show that it significantly outperforms existing QBF solvers.