On finding short resolution refutations and small unsatisfiable subsets

We consider the parameterized problems of whether a given set of clauses can be refuted within k resolution steps, and whether a given set of clauses contains an unsatisfiable subset of size at most k. We show that both problems are complete for the class W[1], the first level of the W-hierarchy of fixed-parameter intractable problems. Our results remain true if restricted to 3-SAT instances and/or to various restricted versions of resolution including tree-like resolution, input resolution, and read-once resolution. Applying a metatheorem of Frick and Grohe, we show that, restricted to classes of sets of clauses of locally bounded treewidth, the considered problems are fixed-parameter tractable. For example, the problems are fixed-parameter tractable for planar CNF formulas.

[1]  Jan Kratochvíl.  A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness , 1994, Discret. Appl. Math..

[2]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[3]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..

[4]  Bruno Courcelle,et al.  On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..

[5]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[6]  Michael Alekhnovich,et al.  Minimum propositional proof length is NP-hard to linearly approximate , 2001, Journal of Symbolic Logic.

[7]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[8]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[9]  Andrei Voronkov,et al.  Current Trends in Theoretical Computer Science , 2001 .

[10]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[11]  Michael Alekhnovich,et al.  Resolution is not automatizable unless W[P] is tractable , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[13]  Toniann Pitassi,et al.  Propositional Proof Complexity: Past, Present and Future , 2001, Bull. EATCS.

[14]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[15]  Peter Clote,et al.  Boolean Functions and Computation Models , 2002, Texts in Theoretical Computer Science. An EATCS Series.

[16]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[17]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[18]  Kazuo Iwama.  Complexity of Finding Short Resolution Proofs , 1997, MFCS.

[19]  Stefan Szeider,et al.  On Fixed-Parameter Tractable Parameterizations of SAT , 2003, SAT.

[20]  A. Dawar.  FINITE MODEL THEORY (Perspectives in Mathematical Logic) , 1997 .

[21]  Martin Grohe,et al.  Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.

[22]  Nathan Linial,et al.  Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.