%0 Journal Article
%T Understanding model counting for $¦Â$-acyclic CNF-formulas
%A Johann Brault-Baron
%A Florent Capelli
%A Stefan Mengel
%J Computer Science
%D 2014
%I arXiv
%X We extend the knowledge about so-called structural restrictions of $\mathrm{\#SAT}$ by giving a polynomial time algorithm for $\beta$-acyclic $\mathrm{\#SAT}$. In contrast to previous algorithms in the area, our algorithm does not proceed by dynamic programming but works along an elimination order, solving a weighted version of constraint satisfaction. Moreover, we give evidence that this deviation from more standard algorithm is not a coincidence, but that there is likely no dynamic programming algorithm of the usual style for $\beta$-acyclic $\mathrm{\#SAT}$.
%U http://arxiv.org/abs/1405.6043v1