38 citations · 246 across the 68 of their papers we have counts for
1 paper · 1 filter
Sebastian Ordyniak, Daniel Paulusma, Stefan Szeider
We show that the Satisfiability (SAT) problem for CNF formulas with β-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution in whi…