A canonical generalization of OBDD
Summary
This arXiv paper introduces Tree Decision Diagrams (TDD) as a canonical generalization of OBDD, situating them within structured d-DNNF with respect to a vtree. It demonstrates that TDDs retain key tractability properties of OBDD while achieving greater succinctness, and shows CNF formulas with treewidth k can be represented in FPT size, unlike with OBDD.