On finding short resolution refutations and small unsatisfiable subsets

Authors:
Michael R. Fellows;Stefan Szeider;Graham Wrightson
Affiliations:
School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia;Department of Computer Science, Durham University, Durham, UK;School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia
Venue:
Theoretical Computer Science - Parameterized and exact computation
Year:
2006

Citing 11
Cited 3

Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas

Journal of Combinatorial Theory Series A
A special planar satisfiability problem and a consequence of its NP-completeness

Discrete Applied Mathematics
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
On the complexity of database queries

Journal of Computer and System Sciences
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Propositional proof complexity: past, present, and future

Current trends in theoretical computer science
Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM (JACM)
Complexity of Finding Short Resolution Proofs

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Resolution is Not Automatizable Unless W[P] is Tractable

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Parameterized Complexity

Parameterized Complexity

Parameterized complexity of the firefighter problem

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Local backbones

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.