New Width Parameters for Model Counting
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00100552" target="_blank" >RIV/00216224:14330/17:00100552 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-319-66263-3_3#citeas" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-66263-3_3#citeas</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-66263-3_3" target="_blank" >10.1007/978-3-319-66263-3_3</a>
Alternative languages
Result language
angličtina
Original language name
New Width Parameters for Model Counting
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
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
Article name in the collection
Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
ISBN
9783319662626
ISSN
0302-9743
e-ISSN
—
Number of pages
15
Pages from-to
38-52
Publisher name
Springer
Place of publication
Nemecko
Event location
Melbourne, Australia
Event date
Jan 1, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000455337600003