Location of Repository

Satisfiability of acyclic and almost acyclic CNF formulas

By Sebastian Ordyniak, Daniel Paulusma and Stefan Szeider

Abstract

We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of their hypergraph structure, by associating to a CNF formula the hypergraph obtained by ignoring negations and considering clauses as hyperedges on variables. We show that satisfiability of CNF formulas with so-called “β-acyclic hypergraphs ” can be decided in polynomial time. We also study the parameterized complexity of SAT for “almost” β-acyclic instances, using as parameter the formula’s distance from being β-acyclic. As distance we use the size of smallest strong backdoor sets and the β-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 (Discr. Appl. Math. 156, 2008)

Topics: Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.84
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.371.7765
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://drops.dagstuhl.de/opus/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.