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
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
A SAT-based solver for Q-ALL SAT
Proceedings of the 44th annual Southeast regional conference
Bounded universal expansion for preprocessing QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Counterexample guided abstraction refinement algorithm for propositional circumscription
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Efficiently solving quantified bit-vector formulas
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Failed literal detection for QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Blocked clause elimination for QBF
CADE'11 Proceedings of the 23rd international conference on Automated deduction
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Quantifier elimination by lazy model enumeration
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
SAT'10 Proceedings of the 13th 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
On propositional QBF expansions and q-resolution
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Experiments with reduction finding
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Quantified maximum satisfiability: a core-guided approach
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Solving existentially quantified horn clauses
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A generalization of SAT and #SAT for robust policy evaluation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Partial synthesis through sampling with and without specification
Proceedings of the International Conference on Computer-Aided Design
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
| Hi-index | 0.00 |
We propose two novel approaches for using Counterexample-Guided Abstraction Refinement (CEGAR) in Quantified Boolean Formula (QBF) solvers. The first approach develops a recursive algorithm whose search is driven by CEGAR (rather than by DPLL). The second approach employs CEGAR as an additional learning technique in an existing DPLL-based QBF solver. Experimental evaluation of the implemented prototypes shows that the CEGAR-driven solver outperforms existing solvers on a number of families in the QBF-LIB and that the DPLL solver benefits from the additional type of learning. Thus this article opens two promising avenues in QBF: CEGAR-driven solvers as an alternative to existing approaches and a novel type of learning in DPLL.