2026-07-20T05:48:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2855 2024-03-06T10:33:37Z ddc:004 open_access

Satisfiability of Acyclic and Almost Acyclic CNF Formulas Ordyniak, Sebastian Paulusma, Daniel Szeider, Stefan Satisfiability chordal bipartite graphs beta-acyclic hypergraphs backdoor sets parameterized complexity 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 ``beta-acyclic hypergraphs'' can be decided in polynomial time. We also 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 smallest strong backdoor sets 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 (Discr. Appl. Math. 156, 2008). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sebastian Ordyniak and Daniel Paulusma and Stefan Szeider 2010 Is Part Of LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2010.84 urn:nbn:de:0030-drops-28556 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.84 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode