[Proof Complexity] Workshop on Proof Complexity - Registration

Olaf Beyersdorff O.Beyersdorff at leeds.ac.uk
Fri Jun 6 12:26:47 CEST 2014

Dear Colleagues,

Just a reminder: Early registration with reduced registration fees ends this Sunday, 8 June. Please find below details of the workshop.

We would be happy to welcome you to the workshop in Vienna!

Best wishes
Olaf and Jan

FLoC workshop on proof complexity - Call for Participation

Vienna, July 12/13 2014

The workshop will be part of the Vienna Summer of Logic and will be affiliated with the conferences SAT'14 and CSL/LICS'14.

=== Scope ===

Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F (e.g. a propositional tautology) and a proof system P (i.e., a formalism usually comprised of axioms and rules), what is the size of the smallest proof of F in the system P?  Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions, which bare tight relations to intricate theoretical open problems from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT solving.

=== Invited Speakers ===

Albert Atserias (UPC Barcelona)
Jakob Nordstrom (KTH Royal Institute of Technology)
Pavel Pudlak (Czech Academy of Sciences)
Iddo Tzameret (Tsinghua University)

=== Programme ===

The preliminary programme of the workshop is available at http://vsl2014.at/pages/PC-index.html.

=== Registration and Accommodation ===

Registration details can be found on http://vsl2014.at/registration/

Accommodation can be booked via http://vsl2014.at/registration/. The workshop will start Saturday morning, so participants should arrive on Friday, 11 July. If you plan to arrive on 11 July, please select July 12 as start date and then fill in the field 'Special Requirements' stating that you need the room from July 11.

=== Program Committee ===

Arnold Beckmann (Swansea University)
Eli Ben-Sasson (Technion, Haifa)
Olaf Beyersdorff (University of Leeds) - chair
Jan Johannsen (LMU Munich) - chair
Massimo Lauria (KTH Royal Institute of Technology, Stockholm)

=== Organizers ===

Olaf Beyersdorff (University of Leeds)
Jan Johannsen (LMU Munich)

Dr Olaf Beyersdorff
School of Computing
University of Leeds, Leeds, LS2 9JT, UK.
Phone: +44 113 343 8319
Email: O.Beyersdorff at leeds.ac.uk<mailto:O.Beyersdorff at leeds.ac.uk>

More information about the Proof-Complexity mailing list