TDDs generalize OBDDs while preserving tractability properties and providing FPT succinctness for treewidth-bounded CNFs, unlike OBDDs.
if the current state is not left-consistent, then, for the t∈Tin which the test failed, add theτr∈Nodesr(t) that witnesses failure toTestsℓ(t), and go back to step 1
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.