Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable
Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable by removing any clause) is NP-hard; it was shown recently that minimal unsatisfiable formulas with n variables and n + k clauses can be recognized in time n O(k). We improve this result and present an algorithm with time complexity O(2kn4) —hence the problem turns out to be fixed-parameter tractable (FTP) in the sense of Downey and Fellows (Parameterized Complexity, Springer Verlag, 1999).
Our algorithm gives rise to an FPT parameterization of SAT (“maximum deficiency”) which is incomparable with known FPT parameterizations of SAT like tree-width.
Unable to display preview. Download preview PDF.
- 2.M. Alekhnovich and A. A. Razborov. Satisfiability, branch-width and Tseitin tautologies. In Proceedings of the 43rd IEEE FOCS, pages 593–603, 2002.Google Scholar
- 5.R. Diestel. Graph Theory. Springer Verlag, New York, 2nd edition, 2000.Google Scholar
- 6.R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer Verlag, 1999.Google Scholar
- 10.H. Kleine Büning. An upper bound for minimal resolution refutations. In Proc. CSL’98, volume 1584 of LNCS, pages 171–178. Springer Verlag, 1999.Google Scholar
- 12.O. Kullmann. Lean clause-sets: Generalizations of minimally unsatisfiable clausesets. To appear in Discr. Appl. Math. Google Scholar
- 13.O. Kullmann. An application of matroid theory to the SAT problem. In Fifteenth Annual IEEE Conference on Computational Complexity, pages 116–124, 2000.Google Scholar
- 17.S. Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Technical Report TR03-002, Revision 1, Electronic Colloquium on Computational Complexity (ECCC), 2003.Google Scholar