14 citations · 26 across the 14 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
A canonical generalization of OBDD
Florent Capelli, YooJung Choi, Stefan Mengel +2
We introduce Tree Decision Diagrams (TDD) as a model for Boolean functions that generalizes OBDD. They can be seen as a restriction of structured d-DNNF; that is, d-DNNF that respe…
cs.AI2017★ 3 cited
Non-FPT lower bounds for structural restrictions of decision DNNF
Andrea Calì, Florent Capelli, Igor Razgon
We give a non-FPT lower bound on the size of structured decision DNNF and OBDD with decomposable AND-nodes representing CNF-formulas of bounded incidence treewidth. Both models are…