Szeider, S. (2004) 'Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.', Journal of computer and system sciences., 69 (4). pp. 656-674.
Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical DP-complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n+k clauses can be recognized in time . We improve this result and present an algorithm with time complexity ; hence the problem turns out to be fixed-parameter tractable (FTP) in the sense of Downey and Fellows (Parameterized Complexity, 1999). Our algorithm gives rise to a fixed-parameter tractable parameterization of the satisfiability problem: If for a given set of clauses F, the number of clauses in each of its subsets exceeds the number of variables occurring in the subset at most by k, then we can decide in time whether F is satisfiable; k is called the maximum deficiency of F and can be efficiently computed by means of graph matching algorithms. Known parameters for fixed-parameter tractable satisfiability decision are tree-width or related to tree-width. Tree-width and maximum deficiency are incomparable in the sense that we can find formulas with constant maximum deficiency and arbitrarily high tree-width, and formulas where the converse prevails.
|Keywords:||SAT problem, Minimal unsatisfiability, Fixed-parameter complexity, DP-complete problem, Tree-width, Bipartite matching, Expansion.|
|Full text:||PDF - Accepted Version (218Kb)|
|Publisher Web site:||http://dx.doi.org/10.1016/j.jcss.2004.04.009|
|Record Created:||14 Oct 2008|
|Last Modified:||15 Jun 2011 16:49|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|