Abstract
We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width). This result strictly generalizes polynomial-time tractability results for classes of formulas with signed incidence graphs of bounded clique-width and classes of formulas with incidence graphs of bounded modular treewidth, which were the most general results of this kind known so far. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Slivovsky, F., & Szeider, S. (2013). Model counting for formulas of bounded clique-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 677–687). https://doi.org/10.1007/978-3-642-45030-3_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
