Talks and Poster Presentations (with Proceedings-Entry):
F. Slivovsky, St. Szeider:
"Model Counting for Formulas of Bounded Clique-Width";
Talk: International Symposium on Algorithms and Computation (ISAAC),
Hong Kong;
2013-12-16
- 2013-12-18; in: "Algorithms and Computation: 24th International Symposium, ISAAC 2013",
L. Cai, S. Cheng, T. Lam (ed.);
Springer / LNCS,
8283
(2013),
ISBN: 978-3-642-45029-7;
677
- 687.
English 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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-45030-3_63
Related Projects:
Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
Created from the Publication Database of the Vienna University of Technology.