On Propositional QBF Expansions and Q-Resolution

  • Mikoláš Janota
  • Joao Marques-Silva
Conference paper

DOI: 10.1007/978-3-642-39071-5_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7962)
Cite this paper as:
Janota M., Marques-Silva J. (2013) On Propositional QBF Expansions and Q-Resolution. In: Järvisalo M., Van Gelder A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mikoláš Janota
    • 1
  • Joao Marques-Silva
    • 2
  1. 1.IST/INESC-IDLisbonPortugal
  2. 2.University College DublinIreland

Personalised recommendations