Conjunctions of constant-width OBDD-representable constraints can be compiled into d-DNNF circuits in fixed-parameter tractable time when parameterized by incidence treewidth.
A faster algorithm for propositional model counting parameterized by incidence treewidth
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Compilation and Fast Model Counting beyond CNF
Conjunctions of constant-width OBDD-representable constraints can be compiled into d-DNNF circuits in fixed-parameter tractable time when parameterized by incidence treewidth.