A combinatorial characterization of resolution width

Journal of Computer and System Sciences

Volumn 74, Issue 3, 2008, Pages 323-334

  Atserias, Albert ^a   Dalmau, Víctor ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

3 CNF formula; Constraint satisfaction problems; Finite model theory; Pebble games; Resolution; Width

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FINITE ELEMENT METHOD; GAME THEORY; OPTIMIZATION; THEOREM PROVING;

CONSTRAINT SATISFACTION PROBLEMS; FINITE MODEL THEORY; PEBBLE GAMES; RESOLUTION WIDTH;

COMBINATORIAL MATHEMATICS;

EID: 38149052234     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.06.025     Document Type: Article

References (29)

1. Alekhnovich M., Ben-Sasson E., Razborov A., and Wigderson A. Space complexity in propositional calculus. SIAM J. Comput. 31 4 (2002) 1184-1211 (a preliminary version appeared in STOC 2000)
2. M. Alekhnovich, A. Razborov, Satisfiability, branch-width and Tseitin tautologies, in: 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 593-603
3. M. Alekhnovich, A.A. Razborov, Resolution is not automatizable unless W[P] is tractable, in: 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 210-219
4. Alekhnovich M., Ben-Sasson E., Razborov A.A., and Wigderson A. Pseudorandom generators in propositional proof complexity. SIAM J. Comput. 34 1 (2004) 67-88 (a preliminary version appeared in FOCS 2000)
5. Atserias A. Unsatisfiable random formulas are hard to certify. J. ACM 51 2 (2004) 281-311 (a preliminary version appeared in LICS 2002)
6. Atserias A., and Bonet M.L. On the automatizability of resolution and related propositional proof systems. Inform. and Comput. 189 2 (2004) 182-201 (a preliminary version appeared in CSL 2002)
7. P. Beame, T. Pitassi, Simplified and improved resolution lower bounds, in: 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 274-282
8. Ben-Sasson E., and Galesi N. Space complexity of random formulas in resolution. Random Structures Algorithms 23 1 (2003) 92-109 (a preliminary version appeared in CCC 2001)
9. Ben-Sasson E., and Wigderson A. Short proofs are narrow-resolution made simple. J. ACM 48 2 (2001) 149-169 (a preliminary version appeared in STOC 1999)
10. Bonet M.L., and Galesi N. Optimality of size-width trade-offs for resolution. Comput. Complexity 10 4 (2001) 261-276 (a preliminary version appeared in FOCS 1999)
11. Chvátal V., and Szemerédi E. Many hard examples for resolution. J. ACM 35 4 (1988) 759-768
12. M. Clegg, J. Edmonds, R. Impagliazzo, Using the Groebner basis algorithm to find proofs of unsatisfiability, in: 27th Annual ACM Symposium on the Theory of Computing, 1995
13. Dalmau V., Kolaitis P.G., and Vardi M.Y. Constraint satisfaction, bounded treewidth, and finite variable logics. 8th International Conference on Principles and Practice of Constraint Programming (CP). Lecture Notes in Comput. Sci. vol. 2470 (2002), Springer-Verlag 310-326
14. Ebbinghaus H., and Flum J. Finite Model Theory (1995), Springer-Verlag
15. Esteban J.L., and Torán J. Space bounds for resolution. Inform. and Comput. 171 1 (2001) 84-97 (a preliminary version appeared in STACS 1999)
16. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28 1 (1998) 57-104 (a preliminary version appeared in STOC 1993)
17. Grohe M. Finite variable logics in descriptive complexity theory. Bull. Symbolic Logic 4 (1998) 345-398
18. Haken A. The intractability of resolution. Theoret. Comput. Sci. 39 (1985) 297-308
19. Kolaitis P.G., and Vardi M.Y. On the expressive power of datalog: Tools and a case study. J. Comput. System Sci. 51 (1995) 110-134
20. Kolaitis P.G., and Vardi M.Y. Conjunctive-query containment and constraint satisfaction. J. Comput. System Sci. 61 2 (2000) 302-332 (a preliminary version appeared in PODS 1998)
21. P.G. Kolaitis, M.Y. Vardi, A game-theoretic approach to constraint satisfaction, in: 7th National Conference on Artificial Intelligence, 2000, pp. 175-181
22. Pudlák P. Proofs as games. Amer. Math. Monthly June-July (2000) 541-550
23. Pudlák P., and Buss S.R. How to lie without being (easily) convicted and the lengths of proofs in propositional calculus. In: Pacholski, and Tiuryn (Eds). Computer Science Logic '94. Lecture Notes in Comput. Sci. vol. 933 (1995), Springer-Verlag 151-162
24. Raz R. Resolution lower bounds for the weak pigeonhole principle. J. ACM 51 2 (2004) 115-138 (a preliminary version appeared in STOC 2002)
25. Razborov A.A. Resolution lower bounds for the weak functional pigeonhole principle. Theoret. Comput. Sci. 303 1 (2003) 233-243
26. Razborov A.A. Resolution lower bounds for perfect matching principles. J. Comput. System Sci. 69 1 (2004) 3-27 (a preliminary version appeared in CCC 2002)
27. Riis S. A complexity gap for tree-resolution. Comput. Complexity 10 (2001) 179-209
28. Torán J. Lower bounds for space in resolution. Computer Science Logic '1999, 13th Annual Conference of the EACSL. Lecture Notes in Comput. Sci. (1999), Springer-Verlag
29. Urquhart A. Hard examples for resolution. J. ACM 34 1 (1987) 209-219