14 citations · 26 across the 14 of their papers we have counts for
Showing 2018 · cs.CCShow all
2 papers · 2 filters
cs.CC2018★ 1 cited
Enumerating models of DNF faster: breaking the dependency on the formula size
Florent Capelli, Yann Strozecki
In this article, we study the problem of enumerating the models of DNF formulas. The aim is to provide enumeration algorithms with a delay that depends polynomially on the size of…
cs.CC2018
Knowledge Compilation, Width and Quantification
Florent Capelli, Stefan Mengel
We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start b…