Learn More
We extend the knowledge about so-called structural restrictions of #SAT by giving a polynomial time algorithm for β-acyclic #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(More)
The notion of graph acyclicity has been extended to several notions of hypergraph acyclicity. In increasing order of generality: <i>gamma</i> acyclicity, <i>beta</i> acyclicity, and <i>alpha</i> acyclicity have met a great interest in many fields. For each notion, we prove the equivalence between the numerous characterizations with a new, simpler proof, in(More)
We extend the knowledge about so-called structural restrictions of #SAT by giving a polynomial time algorithm for β-acyclic #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(More)
  • 1