Counting truth assignments of formulas of bounded tree-width or clique-width Original Research Article

We study algorithms for image and its generalized version image, the problem of computing the number of satisfying assignments of a set of propositional clauses image. For this purpose we consider the clauses given by their incidence graph, a signed bipartite graph image, and its derived graphs image and image.