2 papers
cs.CC2025
Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width
Igor Razgon
Decomposable Negation Normal Forms \textsc{dnnf} [Darwiche, 'Decomposable Negation Normal Form', JACM, 2001] is a landmark Knowledge Compilation (\textsc{kc}) model, highly importa…
cs.CC2025
On complexity of restricted fragments of Decision DNNF
Andrea Calí, Igor Razgon
Decision \textsc{dnnf} (a.k.a. -\textsc{fbdd}) is an important special case of Decomposable Negation Normal Form (\textsc{dnnf}), a landmark knowledge compilation model.…