no code implementations • 10 Mar 2019 • Florent Capelli
In this paper, we study proof systems in the sense of Cook-Reckhow for problems that are higher in the polynomial hierarchy than coNP, in particular, #SAT and maxSAT.
no code implementations • 25 Aug 2017 • Andrea Calì, Florent Capelli, Igor Razgon
We give a non-FPT lower bound on the size of structured decision DNNF and OBDD with decomposable AND-nodes representing CNF-formulas of bounded incidence treewidth.
no code implementations • 5 Jan 2017 • Florent Capelli
In this paper, we make a first step toward the separation of these two techniques by exhibiting a family of formulas that can be solved in polynomial time with the first technique but needs an exponential time with the second one.
no code implementations • 23 May 2014 • Johann Brault-Baron, Florent Capelli, Stefan Mengel
We extend the knowledge about so-called structural restrictions of $\mathrm{\#SAT}$ by giving a polynomial time algorithm for $\beta$-acyclic $\mathrm{\#SAT}$.
no code implementations • 24 Jan 2014 • Florent Capelli, Arnaud Durand, Stefan Mengel
We show that the propositional model counting problem #SAT for CNF- formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time.
