Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
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
Quantified Constraint Optimization
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Unified Framework for Certificate and Compilation for QBF
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Boolean Propagation Based on Literals for Quantified Boolean Formulae
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
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
Fault localization and correction with QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications 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
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
sKizzo: a suite to evaluate and certify QBFs
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
QBF modeling: exploiting player symmetry for simplicity and efficiency
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
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
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 |
A certificate of satisfiability for a quantified boolean formula is a compact representation of one of its models which is used to provide solver-independent evidence of satisfiability. In addition, it can be inspected to gather explicit information about the semantics of the formula. Due to the intrinsic nature of quantified formulas, such certificates demand much care to be efficiently extracted, compactly represented, and easily queried. We show how to solve all these problems.