FLoC2010 Logo

Propositional Proof Complexity: Theory and Practice

Workshop affiliated with the Federated Logic Conference (FLoC 2010)

Edinburgh, July 9, 2010


14:00-15:00 Invited talk

  • Nicola Galesi. The Complexity of Proofs in Parameterized Resolution

15:00-15:30 Coffee break

15:30-17:30 Contributed talks

  • Eli Ben-Sasson and Jakob Nordstrom. Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
  • Stefan Dantchev and Barnaby Martin. Complexity Gap for Parameterized Tree-like Resolution
  • Uwe Bubeck, Hans Kleine Buning, Anja Remshagen and Xishun Zhao. Expressiveness and Complexity of Subclasses of Quantified Boolean Formulas
  • Olga Tveretina. On the Relation of OBDD-based and Resolution-based Proof Systems

A talk by Stephen Cook "Bounded Reverse Mathematics" will be given at July, 10

Programme of LCC on 10th July 2010 can be found here:

(Click to view the information)