Name
Abstract | ||
|---|---|---|
We propose some general techniques for proving lower bounds in expansion-based QBF proof systems. We present them in a framework centred on natural properties of winning strategies in the ‘evaluation game’ interpretation of QBF semantics. As applications, we prove an exponential proof-size lower bound for a whole class of formula families, and demonstrate the power of our approach over existing methods by providing alternative short proofs of two known hardness results. We also use our technique to deduce an interesting result: in the absence of propositional hardness, formulas separating the two major QBF expansion systems must have unbounded quantifier alternations. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00224-019-09940-0 | Theory of Computing Systems |
Keywords | DocType | Volume |
QBF, Proof complexity, Lower-bound techniques, Resolution | Journal | 64 |
Issue | ISSN | Citations |
3 | 1432-4350 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olaf Beyersdorff | 1 | 223 | 30.33 |
| Joshua Blinkhorn | 2 | 3 | 6.16 |