TDDs generalize OBDDs while preserving tractability properties and providing FPT succinctness for treewidth-bounded CNFs, unlike OBDDs.
◀ B Proofs for Section 4 (Tractable Transformations) Elimination of constants.BeforestudyingtransformationsofTDD,weexplainhowonecan remove constant inputs in TDD
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A canonical generalization of OBDD
TDDs generalize OBDDs while preserving tractability properties and providing FPT succinctness for treewidth-bounded CNFs, unlike OBDDs.