A combinatorial characterization of resolution width

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 239-247

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

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; CHARACTERIZATION; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; MODELING LANGUAGES;

RESOLUTION WIDTH;

COMPUTER SCIENCE; GAME THEORY;

CONTEXT MODELING; DATABASE LANGUAGE; LOGIC; RELATIONAL DATABASE; VOCABULARY;

EID: 0042515153     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. M. Alekhnovich, E. Ben-Sasson, A. Razborov, and A. Wigderson. Space complexity in propositional calculus. SIAM Journal of Computing, 31(4):1184-1211, 2002. A preliminary version appeared in STOC'00.
2. M. Alekhnovich and A. Razborov. Satisfiability, branch-width and Tseitin tautologies. In 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 593-603, 2002.
3. M. Alekhnovich and A. A. Razborov. Resolution is not automatizable unless W[P] is tractable. In 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.
4. M. Alekhovich, E. Ben-Sasson, A. A. Razborov, and A. Wigderson. Pseudorandom generators in propositional proof systems. In 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
5. A. Atserias. Unsatisfiable random formulas are hard to certify. In 17th IEEE Symposium on Logic in Computer Science, pages 325-334, 2002.
6. A. Atserias and M. L. Bonet. On the automatizability of resolution and related prepositional proof systems. In Computer Science Logic '2002, 16th Annual Conference of the EACSL, volume 2471 of Lecture Notes in Computer Science, pages 569-583. Springer, 2002.
7. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. In 37th Annual IEEE Symposium on Foundations of Computer Science, pages 274-282, 1996.
8. E. Ben-Sasson and N. Galesi. Space complexity of random formulas in resolution. In 16th IEEE Conference on Computational Complexity, pages 42-51, 2001.
9. E. Ben-Sasson and A. Wigderson. Short proofs are narrow-resolution made simple. J. ACM, 48(2):149-169, 2001.
10. M. L. Bonet and N. Galesi. Optimality of size-width trade-offs for resolution. Journal of Computational Complexity, 2001. To appear. A preliminary version appeared in FOCS'99.
11. V. Chvátal and E. Szemerédi. Many hard examples for resolution. J. ACM, 35(4):759-768, 1988.
12. M. Clegg, J. Edmonds, and R. Impagliazzo. Using the Groebner basis algorithm to find proofs of unsatisfiability. In 27th Annual ACM Symposium on the Theory of Computing, 1995.
13. V. Dalmau, P. G. Kolaitis, and M. Y. Vardi. Constraint satisfaction, bounded treewidth, and finite variable logics. In 8th International Conference on Principles and Practice of Constraint Programming (CP), volume 2470 of Lecture Notes in Computer Science, pages 310-326. Springer, 2002.
14. H. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
15. J. L. Esteban and J. Torán. Space bounds for Resolution. In 16th International Symposium on Theoretical Aspects of Computer Science, pages 530-539, 1999.
16. T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing, 28(1):51-104, 1998.
17. M. Grohe. Finite variable logics in descriptive complexity theory. Bulletin of Symbolic Logic, 4:345-398, 1998.
18. A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.
19. P. G. Kolaitis and M. Y. Vardi. On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences, 51:110-134, 1995.
20. P. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61(2):302-332, 2000.
21. P. G. Kolaitis and M. Y. Vardi. A game-theoretic approach to constraint satisfaction. In 7th National Conference on Artificial Intelligence, pages 175-181, 2000.
22. P. Pudlák. Proofs as games. American Mathematical Monthly, June-July:541-550, 2000.
23. P. Pudlák and S. R. Buss. How to lie without being (easily) convicted and the lengths of proofs in propositional calculus. In Pacholski and Tiuryn, editors, Computer Science Logic '94, volume 933 of Lecture Notes in Computer Science, pages 151-162. Springer-Verlag, 1995.
24. R. Raz. Resolution lower bounds for the weak pigeonhole principle. In 34th Annual ACM Symposium on the Theory of Computing, 2002.
25. A. A. Razborov. Resolution lower bounds for perfect matching principles. In 17th IEEE Conference on Computational Complexity, pages 29-38, 2002.
26. S. Riis. A complexity gap for tree-resolution. Computational Complexity, 10:179-209, 2001.
27. J. Torán. Lower bounds for space in Resolution. In Computer Science Logic '1999, 13th Annual Conference of the EACSL, Lecture Notes in Computer Science. Springer-Verlag, 1999.
28. A. Urquhart. Hard examples for resolution. J. ACM, 34(1):209-219, 1987.