Proof Complexity of Resolution-based QBF Calculi


Proof systems for quantified Boolean formulas (QBFs) provide a theoretical underpinning for the performance of important QBF solvers. However, the proof complexity of these proof systems is currently not well understood and in particular lower bound techniques are missing. In this paper we exhibit a new and elegant proof technique for showing lower bounds… (More)
DOI: 10.4230/LIPIcs.STACS.2015.76


5 Figures and Tables

Slides referencing similar topics