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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A satisfiability procedure for quantified boolean formulae
Discrete Applied Mathematics - The renesse issue on satisfiability
Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
Extracting certificates from quantified boolean formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Extended resolution proofs for conjoining BDDs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
QBF reasoning on real-world instances
SAT'04 Proceedings of the 7th 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
sKizzo: a suite to evaluate and certify QBFs
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Binary clause reasoning in QBF
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A Unified Framework for Certificate and Compilation for QBF
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
A Compact Representation for Syntactic Dependencies in QBFs
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
Failed literal detection for QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Resolution proofs and Skolem functions in QBF evaluation and applications
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Validating QBF validity in HOL4
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Proving valid quantified Boolean formulas in HOL light
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Automated testing and debugging of SAT and QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Integrating dependency schemes in search-based QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Ranking function synthesis for bit-vector relations
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Validating QBF invalidity in HOL4
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A uniform approach for generating proofs and strategies for both true and false QBF formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Unified QBF certification and its applications
Formal Methods in System Design
Extended failed-literal preprocessing for quantified boolean formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On sequent systems and resolution for QBFs
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Nested boolean functions as models for quantified boolean formulas
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
Compared to SAT, there is no simple concept of what a solution to a QBF problem is. Furthermore, as the series of QBF evaluations shows, the QBF solvers that are available often disagree. Thus, proof generation for QBF seems to be even more important than for SAT. In this paper we propose a new uniform proof format, which captures refutations and witnesses for a variety of QBF solvers, and is based on a novel extended resolution rule for QBF. Our experiments show the flexibility of this new format. We also identify shortcomings of our format and conjecture that a purely resolution based proof calculus is not powerful enough to trace the most efficient solvers.