On finding short resolution refutations and small unsatisfiable subsets

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 351-359

  Fellows, Michael R ^a   Szeider, Stefan ^b   Wrightson, Graham ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Bounded local treewidth; Parameterized complexity; Planar formulas; Resolution complexity; W 1 completeness

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

BOUNDED LOCAL TREEWIDTH; PARAMETERIZED COMPLEXITY; PLANAR FORMULAS; RESOLUTION COMPLEXITY; W[1]-COMPLETENESS;

SET THEORY;

EID: 32144459851     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.005     Document Type: Conference Paper

References (20)

1. R. Aharoni, and N. Linial Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas J. Combin. Theory Ser. A 43 1986 196 204
2. M. Alekhnovich, S. Buss, S. Moran, and T. Pitassi Minimum propositional proof length is NP-hard to linearly approximate J. Symbolic Logic 66 1 2001 171 191
3. M. Alekhnovich, and A.A. Razborov Resolution is not automatizable unless W[P] is tractable 42nd IEEE Symp. on Foundations of Computer Science, FOCS 2001 2001 IEEE Computer Society 210 219
4. P. Beame, and T. Pitassi Propositional proof complexity: past, present, and future Current Trends in Theoretical Computer Science 2001 World Scientific Publishing River Edge, NJ 42 70
5. H.L. Bodlaender A partial k-arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209 1-2 1998 1 45
6. P. Clote, and E. Kranakis Boolean Functions and Computation Models 2002 Springer Berlin
7. B. Courcelle, J.A. Makowsky, and U. Rotics On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic Discrete Appl. Math. 108 1-2 2001 23 52
8. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Berlin
9. H.-D. Ebbinghaus, and J. Flum Finite model theory, Perspectives in Mathematical Logic second ed. 1999 Springer Berlin
10. M. Frick, and M. Grohe Deciding first-order properties of locally tree-decomposable structures J. ACM 48 6 2001 1184 1206
11. A. Haken The intractability of resolution Theoret. Comput. Sci. 39 1985 297 308
12. K. Iwama, Complexity of finding short resolution proofs, in: Mathematical foundations of computer science, MFCS 1997, Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin, 1997, pp. 309-318.
13. J. Kratochvíl A special planar satisfiability problem and a consequence of its NP-completeness Discrete Appl. Math. 52 1994 233 252
14. L. Libkin Elements of finite model theory, Texts in Theoretical Computer Science 2004 Springer Berlin
15. D. Lichtenstein Planar formulae and their uses SIAM J. Comput. 11 2 1982 329 343
16. C.H. Papadimitriou, and M. Yannakakis On the complexity of database queries J. Comput. System Sci. 58 3 1999 407 427
17. S. Szeider, On fixed-parameter tractable parameterizations of SAT, in: E. Giunchiglia, A. Tacchella (Eds.), Theory and applications of satisfiability, Sixth Internat. Conf., SAT 2003, Selected and revised papers, Lecture Notes in Computer Science, Vol. 2919, Springer, Berlin, 2004, pp. 188-202.
18. C.A. Tovey A simplified NP-complete satisfiability problem Discrete Appl. Math. 8 1 1984 85 89
19. G.S. Tseitin On the complexity of derivation in propositional calculus Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR 8 1968 23 41 (in Russian)
20. J. Siekmann, G. Wrightson (Eds.), Automation of reasoning, Classical Papers on Computer Science 1967-1970, Springer, Berlin, 1983, pp. 466-483. (English translation).