SDD- and d-SDNNF-based proof systems produce strictly smaller refutations than OBDD systems for unsatisfiable CNFs, with multiple separations under varying rules and a new 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
fields
cs.CC 2years
2026 2verdicts
UNVERDICTED 2representative 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
SDD- and d-SDNNF-based proof systems produce strictly smaller refutations than OBDD systems for unsatisfiable CNFs, with multiple separations under varying rules and a new 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.