D 2017

New Width Parameters for Model Counting

GANIAN, Robert and Stefan SZEIDER

Basic information

Original name

New Width Parameters for Model Counting

Authors

GANIAN, Robert (203 Czech Republic, guarantor, belonging to the institution) and Stefan SZEIDER (40 Austria)

Edition

Nemecko, Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, p. 38-52, 15 pp. 2017

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10200 1.2 Computer and information sciences

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

electronic version available online

References:

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/17:00100552

Organization unit

Faculty of Informatics

ISBN

978-3-319-66262-6

ISSN

DOI

UT WoS

000455337600003

Keywords in English

Treewidth; Model Counting; SAT; Parameterized Complexity

Tags

Změněno: 28/4/2020 12:17, Mgr. Michal Petr

Abstract

V originále

We study the parameterized complexity of the propositional model counting problem #SAT for CNF formulas. As the parameter we consider the treewidth of the following two graphs associated with CNF formulas: the consensus graph and the conflict graph. Both graphs have as vertices the clauses of the formula; in the consensus graph two clauses are adjacent if they do not contain a complementary pair of literals, while in the conflict graph two clauses are adjacent if they do contain a complementary pair of literals. We show that #SAT is fixed-parameter tractable for the treewidth of the consensus graph but W[1]-hard for the treewidth of the conflict graph. We also compare the new parameters with known parameters under which #SAT is fixed-parameter tractable.