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
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
Bounded Model Construction for Monadic Second-Order Logics
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
Specifying and analyzing early requirements in Tropos
Requirements Engineering
Considering Circuit Observability Don't Cares in CNF Satisfiability
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
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
A solver for QBFs in negation normal form
Constraints
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
A Solver for QBFs in Nonprenex Form
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Solving QBF with combined conjunctive and disjunctive normal form
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
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
Dependency quantified horn formulas: models and complexity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
The best currently available solvers for Quantified Boolean Formulas (QBFs) process their input in prenex form, i. e., all the quantifiers have to appear in the prefix of the formula separated from the purely propositional part representing the matrix. However, in many QBFs deriving from applications, the propositional part is intertwined with the quantifier structure. To tackle this problem, the standard approach is to first convert them in prenex form, thereby loosing structural information about the prefix.In this paper we show that conversion to prenex form is not necessary, i. e., that it is relatively easy to extend current search based solvers in order to exploit the original quantifier structure, i. e., to handle non prenex QBFs. Further, we show that the conversion can lead to the exploration of search spaces bigger than the space explored by solvers handling non prenex QBFs. To validate our claims, we implemented our ideas in the state-of-the-art search based solver QUBE, and conducted an extensive experimental analysis. The results show that very substantial speedups can be obtained.