Model Counting for Formulas of Bounded Clique-Width
Computational Complexity
2014-10-01 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.1409.8464,
title = {Model Counting for Formulas of Bounded Clique-Width},
author = {Friedrich Slivovsky and Stefan Szeider},
journal= {arXiv preprint arXiv:1409.8464},
year = {2014}
}
Comments
Extended version of a paper published at ISAAC 2013