| ORDYNIAK, Sebastian, Daniel PAULUSMA a Stefan SZEIDER. Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science. Amsterdam: Elsevier, 2013, roč. 481, č. 1, s. 85-99. ISSN 0304-3975. Dostupné z: https://dx.doi.org/10.1016/j.tcs.2012.12.039. |
Další formáty:
BibTeX
LaTeX
RIS
@article{1173808,
author = {Ordyniak, Sebastian and Paulusma, Daniel and Szeider, Stefan},
article_location = {Amsterdam},
article_number = {1},
doi = {http://dx.doi.org/10.1016/j.tcs.2012.12.039},
keywords = {Acyclic hypergraph; Chordal bipartite graph; Davis-Putnam resolution},
language = {eng},
issn = {0304-3975},
journal = {Theoretical Computer Science},
title = {Satisfiability of acyclic and almost acyclic CNF formulas},
volume = {481},
year = {2013}
}
TY - JOUR
ID - 1173808
AU - Ordyniak, Sebastian - Paulusma, Daniel - Szeider, Stefan
PY - 2013
TI - Satisfiability of acyclic and almost acyclic CNF formulas
JF - Theoretical Computer Science
VL - 481
IS - 1
SP - 85-99
EP - 85-99
PB - Elsevier
SN - 03043975
KW - Acyclic hypergraph
KW - Chordal bipartite graph
KW - Davis-Putnam resolution
N2 - We show that the SATISFIABILITY (SAT) problem for CNF formulas with beta-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution in which each resolvent is a subset of a parent clause. We extend this class to CNF formulas for which this type of Davis-Putnam resolution still applies and show that testing membership in this class is NP-complete. We compare the class of beta-acyclic formulas and this superclass with a number of known polynomial formula classes. We then study the parameterized complexity of SAT for "almost" beta-acyclic instances, using as parameter the formula's distance from being beta-acyclic. As distance we use the size of a smallest strong backdoor set and the beta-hypertree width. As a by-product we obtain the W[1]-hardness of SAT parameterized by the (undirected) clique-width of the incidence graph, which disproves a conjecture by Fischer, Makowsky, and Ravve. (C) 2013 Elsevier B.V. All rights reserved.
ER -
ORDYNIAK, Sebastian, Daniel PAULUSMA a Stefan SZEIDER. Satisfiability of acyclic and almost acyclic CNF formulas. \textit{Theoretical Computer Science}. Amsterdam: Elsevier, 2013, roč.~481, č.~1, s.~85-99. ISSN~0304-3975. Dostupné z: https://dx.doi.org/10.1016/j.tcs.2012.12.039.
|
