SDDs and d-SDNNFs yield strictly smaller refutations than OBDDs for unsatisfiable CNFs, with separations under different derivation rules and a sat-to-unsat lifting theorem.
6 Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, and Dmitry Sokolov
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
unclear 1representative citing papers
The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.
citing papers explorer
-
Proof Systems Based on Structured Circuits
SDDs and d-SDNNFs yield strictly smaller refutations than OBDDs for unsatisfiable CNFs, with separations under different derivation rules and a sat-to-unsat lifting theorem.
-
Hard CNF Instances for Ideal Proof Systems
The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.