Short Proofs in QBF Expansion

We aim to understand inherent reasons for lower bounds for QBF proof systems and revisit and compare two previous approaches in this direction. The first of these relates size lower bounds for strong QBF Frege systems to circuit lower bounds via strategy extraction (Beyersdorff and Pich, LICS’16). Here, we show a refined version of strategy extraction and thereby for any QBF proof system obtain a trichotomy for hardness: (1) via circuit lower bounds, (2) via propositional Resolution lower bounds, or (3) “genuine” QBF lower bounds. The second approach tries to explain QBF lower bounds through quantifier alternations in a system called relaxing QU-Res (Chen, ACM TOCT 2017). We prove a strong lower bound for relaxing QU-Res, which at the same time exhibits significant shortcomings of that model. Prompted by this, we introduce a hierarchy of new systems that improve Chen’s model and prove a strict separation for the complexity of proofs in this hierarchy. We show that lower bounds in our new model correspond to the trichotomy obtained via strategy extraction.

show abstract

Short Proofs in QBF Expansion

Cited by 3 publications

References 21 publications

How QBF Expansion Makes Strategy Extraction Hard

How QBF Expansion Makes Strategy Extraction Hard

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness

Reasons for Hardness in QBF Proof Systems

Contact Info

Product

Resources

About