A Unified Framework for Certificate and Compilation for QBF

Authors:
Igor Stéphan;Benoit Mota
Affiliations:
LERIA University of Angers, France;LERIA University of Angers, France
Venue:
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Year:
2009

Citing 20
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Resolution for quantified Boolean formulas

Information and Computation
A machine program for theorem-proving

Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation

Journal of Automated Reasoning
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
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
Boolean Functions as Models for Quantified Boolean Formulas

Journal of Automated Reasoning
On the use of partially ordered decision graphs for knowledge compilation and quantified Boolean formulae

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Solving QBF with combined conjunctive and disjunctive normal form

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Propositional fragments for knowledge compilation and quantified boolean formulae

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Clause/term resolution and learning in the evaluation of quantified Boolean formulas

Journal of Artificial Intelligence Research
A knowledge compilation map

Journal of Artificial Intelligence Research
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
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
Nenofex: expanding NNF for QBF solving

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Resolve and expand

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose in this article a unified framework for certificate and compilation for QBF. We provide a search-based algorithm to compute a certificate for the validity of a QBF and a search-based algorithm to compile a valid QBF in our unified framework.