All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

Result description

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, andRavve] -- 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.

Keywords

propositional model countingsatisfiabilityrank-widthclique-widthparameterized complexity

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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, andRavve] -- 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.

  • Czech name

  • Czech description

Classification

  • Type

    Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Fundamenta Informaticae

  • ISSN

    0169-2968

  • e-ISSN

  • Volume of the periodical

    123

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    59-76

  • UT code for WoS article

    000317267500005

  • EID of the result in the Scopus database

Basic information

Result type

Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

Jx

CEP

IN - Informatics

Year of implementation

2013