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.
11 Dmitry Itsykson, Alexander Knop, Andrei E
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.