Name
Abstract | ||
|---|---|---|
Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF by replacing the linear order of the quantifier prefix with a partial order. We propose to merge the two, by reinterpreting a dependency scheme as a mapping from QBF into DQBF. Our approach offers a fresh insight on the nature of soundness in proof systems for QBF with dependency schemes, in which a natural property called ‘full exhibition’ is central. We apply our approach to QBF proof systems from two distinct paradigms, termed ‘universal reduction’ and ‘universal expansion’. We show that full exhibition is sufficient (but not necessary) for soundness in universal reduction systems for QBF with dependency schemes, whereas for expansion systems the same property characterises soundness exactly. We prove our results by investigating DQBF proof systems, and then employing our reinterpretation of dependency schemes. Finally, we show that the reflexive resolution path dependency scheme is fully exhibited, thereby proving a conjecture of Slivovsky. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10817-018-9482-4 | Journal of Automated Reasoning |
Keywords | Field | DocType |
Quantified Boolean formulas, DQBF, Dependency schemes, F.2.2 Nonnumerical algorithms and problems | Discrete mathematics,Theoretical computer science,Prefix,Reinterpretation,Soundness,Merge (version control),Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
63 | 3 | 1573-0670 |
Citations | PageRank | References |
0 | 0.34 | 27 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olaf Beyersdorff | 1 | 223 | 30.33 |
| Joshua Blinkhorn | 2 | 3 | 6.16 |
| Leroy Chew | 3 | 55 | 7.02 |
| Renate A. Schmidt | 4 | 857 | 83.52 |
| Martin Suda 0001 | 5 | 9 | 4.54 |