Informace o publikaci

Better algorithms for satisfiability problems for formulas of bounded rank-width

Autoři

GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan

Druh Článek v odborném periodiku
Časopis / Zdroj Fundamenta Informaticae
Fakulta / Pracoviště MU

Fakulta informatiky Fakulta sociálních studií

Citace
Doi http://dx.doi.org/10.3233/FI-2013-800
Obor Informatika
Klíčová slova propositional model counting; satisfiability; rank-width; clique-width; parameterized complexity
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info