Logic and Computational Complexity

An International Workshop Series


 

LCC'19 MEETING

The Twenteeth International Workshop on Logic and Computational Complexity will be held in Patras, Greece, on July 8, 2019, as part of ICALP .

LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in 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); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity.

The program will consist of invited lectures as well as contributed papers selected by the Program Committee.

IMPORTANT DATES

Submission deadline: May 1, 2019
Authors' notification: May 20, 2019
Workshop: July 8, 2019

INVITED SPEAKERS

  • Daniel Leivant - Title: Finite functions as data objects: A new approach to complexity certification (Indiana University, US)
  • Ramyaa - Title: First order logic with least fixed point operator (New Mexico Tech, US)
  • Thomas Seiller - Title: Semantics and complexity lower bounds (CNRS Paris, France)
  • Thomas Zeume - Title: Dynamic Descriptive Complexity of Reachability (TU Dortmund, Germany)

CONTRIBUTED TALKS

    Carlos Camino, Volker Diekert, Besik Dundua and Mircea Marin. About a Conway-type result for tree language
    Amirhossein Akbar Tabatabai. Witnessing Games in Generalized Bounded Arithmetic
    Raheleh Jalali. Proof Complexity of Focused Calculi
    Le Thanh Dung Nguyen. Logarithmic space queries and regular transductions in the elementary affine lambda-calculus
    Eleni Bakali, Aggeliki Chalki and Aris Pagourtzis. Descriptive complexity of classes of easy-to-decide counting problems
    Arved Friedmann, Jay Morgan. Using Satisfiablity Solvers for Problems in Machine Learning (tbc)

PROGRAM CHAIRS

PROGRAM COMMITTEE

SUBMISSION OF PAPERS

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:

https://easychair.org/conferences/?conf=lcc19

We also welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback.

REGISTRATION

See ICAPL 2019 registration (Please register asap, early registration ends 9th June.)

CONTACT

To contact the workshop organizers, please send e-mail to lcc19@easychair.org.