License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2010.73
URN: urn:nbn:de:0030-drops-28541
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2854/

Ganian, Robert ; Hlinený, Petr ; Obdrzálek, Jan

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width

pdf-format:
Dokument 1.pdf (484 KB)


Abstract

We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known --e.g. [Fischer, Makowsky, and Ravve]-- with a single-exponential dependency on the clique-width of a formula. Our algorithm thus presents an exponential runtime improvement (since clique-width reaches up to exponentially higher values than rank-width), and can be of practical interest for small values of rank-width. We also provide an algorithm for the MAX-SAT problem along the same lines.

BibTeX - Entry

@InProceedings{ganian_et_al:LIPIcs:2010:2854,
  author =	{Robert Ganian and Petr Hlinen{\'y} and Jan Obdrz{\'a}lek},
  title =	{{Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
  pages =	{73--83},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-23-1},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{8},
  editor =	{Kamal Lodaya and Meena Mahajan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2854},
  URN =		{urn:nbn:de:0030-drops-28541},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.73},
  annote =	{Keywords: propositional model counting; satisfiability; rank-width; clique-width ; parameterized complexity}
}

Keywords: propositional model counting; satisfiability; rank-width; clique-width ; parameterized complexity
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Issue date: 2010
Date of publication: 14.12.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI