[Back]

D. Paulusma, F. Slivovsky, St. Szeider:
"Model Counting for CNF Formulas of Bounded Modular Treewidth";
Talk: Symposium on Theoretical Aspects of Computer Science (STACS), Kiel, Germany; 2013-02-27 - 2013-03-02; in: "30th Symposium on Theoretical Aspects of Computer Science (STACS´13)", N. Portier, T. Wilke (ed.); Dagstuhl Publishing, 20 (2013), ISBN: 978-3-939897-50-7; 55 - 66.

The modular treewidth of a graph is its treewidth after the contraction of modules. Modular treewidth properly generalizes treewidth and is itself properly generalized by clique-width. We show that the number of satisfying assignments of a CNF formula whose incidence graph has bounded modular treewidth can be computed in polynomial time. This provides new tractable classes of formulas for which #SAT is polynomial. In particular, our result generalizes known results for the treewidth of incidence graphs and is incomparable with known results for clique-width (or rank-width) of signed incidence graphs. The contraction of modules is an effective data reduction procedure. Our algorithm is the first one to harness this technique for #SAT. The order of the polynomial time bound of our algorithm depends on the modular treewidth. We show that this dependency cannot be avoided subject to an assumption from Parameterized Complexity.

Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems