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.
5 Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky
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
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.