Resolution for quantified Boolean formulas
Information and Computation
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic (TOCL)
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A structural approach to reasoning with quantified Boolean formulas
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Minimal module extraction from DL-lite ontologies using QBF solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A first step towards a unified proof checker for QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Dynamically partitioning for solving QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Backdoor sets of quantified boolean formulas
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Fault localization and correction with QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Learning to integrate deduction and search in reasoning about quantified boolean formulas
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
An AIG-Based QBF-solver using SAT for preprocessing
Proceedings of the 47th Design Automation Conference
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
Exploiting structure in an AIG based QBF solver
Proceedings of the Conference on Design, Automation and Test in Europe
Failed literal detection for QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Synthesizing data structure manipulations from storyboards
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
A generalization of SAT and #SAT for robust policy evaluation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Binary clause reasoning has found some successful applications in SAT, and it is natural to investigate its use in various extensions of SAT. In this paper we investigate the use of binary clause reasoning in the context of solving Quantified Boolean Formulas (QBF). We develop a DPLL based QBF solver that employs extended binary clause reasoning (hyper-binary resolution) to infer new binary clauses both before and during search. These binary clauses are used to discover additional forced literals, as well as to perform equality reduction. Both of these transformations simplify the theory by removing one of its variables. When applied during DPLL search this stronger inference can offer significant decreases in the size of the search tree, but it can also be costly to apply. We are able to show empirically that despite the extra costs, binary clause reasoning can improve our ability to solve QBF.