[Proof Complexity] LCC 2014/ImmermanFest: Call for Papers

Arnold Beckmann A.Beckmann at swansea.ac.uk
Tue Feb 4 15:53:25 CET 2014

[Please broadcast/post/forward.   Apologies for duplicates]


     Abstract submission deadline:  May  2nd, 2014
     Authors' notification:         May 19th, 2014

The Fifteenth International Workshop on Logic and Computational 
Complexity and Workshop in Honor of Neil Immerman's 60th Birthday 
(LCC 2014/ImmermanFest, http://www.cs.swansea.ac.uk/lcc2014/) 
will be held in Vienna, Austria, on July 12-13, 2014, as an 
affiliated meeting of the Vienna Summer of Logic.  The 
LCC 2014/ImmermanFest program will consist of a first day 
(July 12th) of talks which include both invited lectures and 
contributed talks selected by the program committee (based on 
submitted abstracts), and a second day (July 13th) devoted entirely 
to invited talks in celebration of Neil Immerman's 60th birthday.

LCC meetings are aimed at the foundational interconnections 
between logic and computational complexity, as present in, for 
example: finite model theory and descriptive complexity; implicit 
computational complexity (descriptive and type-theoretic 
methods); deductive formalisms as they relate to complexity (e.g. 
ramification, weak comprehension, bounded arithmetic, linear 
logic and resource logics); logic and complexity-theoretic 
aspects of databases; complexity-mindful program verification and 
synthesis; computational complexity at higher type; and proof 

Neil Immerman has made numerous fundamental and inspiring 
contributions to the connections between logic and complexity. 
In particular, he has been one of the leading figures in the 
development of descriptive complexity, which has elucidated 
intimate and beautiful connections between complexity theory and 
finite model theory.  This year, day two of LCC 2014 will honor 
Neil's 60th birthday with a series of invited lectures by some of 
the leading researchers working in areas that have been 
influenced by Neil's work.

The invited speakers on day one of LCC 2014 are:

    * Sam Buss (University of California, San Diego)
    * Georg Moser (University of Innsbruck)

The invited speakers for ImmermanFest (day two) are:

    * Eric Allender (Rutgers)
    * Anuj Dawar (University of Cambridge)
    * Phokion Kolaitis (University of California, Santa Cruz)
    * Benjamin Rossman (Tokyo Institute of Technology)
    * Mooly Sagiv (Tel Aviv University)
    * Nicole Schweikardt (Goethe University Frankfurt am Main)

There will be no published proceedings for LCC 2014, and we 
welcome submissions of abstracts based on work submitted or 
published elsewhere, provided that all pertinent information is 
disclosed at submission time. Submissions must be in English and 
in the form of an abstract of about 3-4 pages.  All submissions 
should be submitted through Easychair at:
by the deadline.  For additional information see 
http://www.cs.swansea.ac.uk/lcc/ or email lcc2014 at easychair.org


    * Arnold Beckmann (Swansea University, co-chair)
    * Ulrich Berger (Swansea University)
    * Olaf Beyersdorff (University of Leeds)
    * Yijia Chen (Shanghai Jiao Tong University)
    * Anuj Dawar (University of Cambridge)
    * Kousha Etessami (University of Edinburgh, co-chair)
    * Martin Grohe (RWTH Aachen)
    * Martin Hofmann (LMU Munich)
    * Leszek Kolodziejczyk (University of Warsaw)
    * Stephan Kreutzer (Technical University Berlin)
    * Mooly Sagiv (Tel Aviv University)
    * Shlomo Zilberstein (University of Massachusetts, Amherst)


Michael Benedikt (Oxford), Ulrich Berger (Swansea, co-chair), 
Robert Constable (Cornell) Anuj Dawar (Cambridge, co-chair), 
Arnaud Durand, Fernando Ferreira (Lisbon), Joerg Flum, Martin 
Hofmann (U Munich), Neil Jones (Copenhagen), Daniel Leivant 
(Indiana U), Jean-Yves Marion (LORIA Nancy), Simone Martini, 
Yannis Moschovakis (UCLA), Isabel Oitavem, Luke Ong (Oxford), 
James Royer (Syracuse), Helmut Schwichtenberg (U Munich)

More information about the Proof-Complexity mailing list