Resolution-based certificate extraction for QBF

Authors:
Aina Niemetz;Mathias Preiner;Florian Lonsing;Martina Seidl;Armin Biere
Affiliations:
Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria;Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria;Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria;Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria;Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria
Venue:
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Year:
2012

Citing 6
Cited 3

Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Evaluating and certifying QBFs: A comparison of state-of-the-art tools

AI Communications
Verifying propositional unsatisfiability: pitfalls to avoid

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
Integrating dependency schemes in search-based QBF solvers

SAT'10 Proceedings of the 13th 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

Efficient clause learning for quantified boolean formulas via QBF pseudo unit propagation

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
Nested boolean functions as models for quantified boolean formulas

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A certificate of (un)satisfiability for a quantified Boolean formula (QBF) represents sets of assignments to the variables, which act as witnesses for its truth value. Certificates are highly requested for practical applications of QBF like formal verification and model checking. We present an integrated set of tools realizing resolution-based certificate extraction for QBF in prenex conjunctive normal form. Starting from resolution proofs produced by the solver DepQBF, we describe the workflow consisting of proof checking, certificate extraction, and certificate checking. We implemented the steps of that workflow in stand-alone tools and carried out comprehensive experiments. Our results demonstrate the practical applicability of resolution-based certificate extraction.