Name
Abstract | ||
|---|---|---|
We provide the first proof complexity results for QBF dependency calculi. By showing that the reflexive resolution path dependency scheme admits exponentially shorter Q-resolution proofs on a known family of instances, we answer a question first posed by Slivovsky and Szeider in 2014 [37]. Further, we conceive a method of QBF solving in which dependency recomputation is utilised as a form of inprocessing. Formalising this notion, we introduce a new version of Q-resolution in which a dependency scheme is applied dynamically. We demonstrate the further potential of this approach beyond that of the existing static system with an exponential separation. Last, we show that the same picture emerges in an analogous approach to the universal expansion paradigm.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3355995 | ACM Transactions on Computational Logic (TOCL) |
Keywords | Field | DocType |
Quantified Boolean formulas,dependency schemes,proof complexity | Discrete mathematics,Algebra,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 2 | 1529-3785 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olaf Beyersdorff | 1 | 223 | 30.33 |
| Joshua Blinkhorn | 2 | 3 | 6.16 |