2 citations · 3 across the 4 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2017
Understanding the complexity of #SAT using knowledge compilation
Florent Capelli
Two main techniques have been used so far to solve the #P-hard problem #SAT. The first one, used in practice, is based on an extension of DPLL for model counting called exhaustive…
cs.CC2014★ 2 cited
A Strongly Exponential Separation of DNNFs from CNF Formulas
Simone Bova, Florent Capelli, Stefan Mengel +1
Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables.…
cs.CC2014★ 1 cited
Understanding model counting for -acyclic CNF-formulas
Johann Brault-Baron, Florent Capelli, Stefan Mengel
We extend the knowledge about so-called structural restrictions of by giving a polynomial time algorithm for -acyclic . In contrast to previous…