d-DNNF is Not Polynomially Closed Under NegationResearch Paper
Deterministic decomposable negation normal form circuits (d-DNNFs) are a central target language of knowledge compilation: a d-DNNF supports exact model counting, weighted model counting and sampling in time polynomial in its size (Darwiche–Marquis 2002). Compiling a CNF into a d-DNNF and then counting is a standard approach to #SAT, and d-DNNFs are used…