14 citations · 26 across the 14 of their papers we have counts for
4 papers · 1 filter
Connecting Knowledge Compilation Classes and Width Parameters
Antoine Amarilli, Florent Capelli, Mikaël Monet +1
The field of knowledge compilation establishes the tractability of many tasks by studying how to compile them to Boolean circuit classes obeying some requirements such as structure…
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…
Counting Minimal Transversals of -Acyclic Hypergraphs
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
We prove that one can count in polynomial time the number of minimal transversals of -acyclic hypergraphs. In consequence, we can count in polynomial time the number of minimal…
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…