1 citations · 3 across the 5 of their papers we have counts for
1 paper · 2 filters
Vincent Derkinderen, Pedro Zuidberg Dos Martires, Samuel Kolb +1
Propositional model counting (#SAT) can be solved efficiently when the input formula is in deterministic decomposable negation normal form (d-DNNF). Translating an arbitrary formul…