Resolution for quantified Boolean formulas
Information and Computation
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
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
Journal of Artificial Intelligence Research
Improvements to the evaluation of quantified boolean formulae
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Bounded universal expansion for preprocessing 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
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A non-prenex, non-clausal QBF solver with game-state learning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Unified QBF certification and its applications
Formal Methods in System Design
On sequent systems and resolution for QBFs
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Solving QBF with counterexample guided refinement
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Over the years, proof systems for propositional satisfiability (SAT) have been extensively studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been gaining attention. Q-resolution is a calculus enabling producing proofs from DPLL-based QBF solvers. While DPLL has become a dominating technique for SAT, QBF has been tackled by other complementary and competitive approaches. One of these approaches is based on expanding variables until the formula contains only one type of quantifier; upon which a SAT solver is invoked. This approach motivates the theoretical analysis carried out in this paper. We focus on a two phase proof system, which expands the formula in the first phase and applies propositional resolution in the second. Fragments of this proof system are defined and compared to Q-resolution.