Highlights and changes for LICS 2012:
------------
Starting with 2012, there will be some changes in the way LICS is organised, which we highlight here:

- Starting 2012, LICS is jointly organized by ACM and IEEE, and is
   cosponsored by ACM SIGACT and the IEEE Computer Society.

- In response to concerns about LICS becoming overly selective with
  a too-narrow technical focus, the program committee will employ a
  merit-based selection with no a priori limit on the number of
  accepted papers.

  All papers meeting the LICS quality standards will be published,
  regardless of popularity of topic. The programme will be scheduled
  to accommodate the accepted papers.

- LICS 2012 will continue the tradition of pre-conference tutorials
  that was initiated in 2011.  This year,
  * Jan Willem Klop will give a tutorial on term rewrite systems and
  * Andre Platzer will give a tutorial on logics of dynamical systems.

-  Special Events and Invited Lectures:
   There will be an invited lecture by
   * Robert J. Aumann, winner of the 2005 Nobel Prize in Economic
     Sciences, and
   * a plenary session in honor of Alan Turing on the occasion of his
      centenary, with talks by
      Robert L. Constable,
      E. Allen Emerson (co-winner of 2008 A. M. Turing Award),
      Joan Feigenbaum, and
     Leonid Levin.




                                      CALL FOR PAPERS

LICS 2012 will be hosted by the University of Dubrovnik, in Dubrovnik, Croatia, from June 25th to 28th, 2012.

The LICS Symposium is an annual international forum on theoretical and practical topics in computer
science that relate to logic, broadly construed. We invite submissions on topics that fit under 
that rubric.  Suggested, but not exclusive, topics of interest include:
automata theory, automated deduction, categorical models and logics, concurrency and distributed 
computation, constraint programming, constructive mathematics, database theory, decision procedures,
description logics, domain theory, finite model theory, formal aspects of program analysis, formal 
methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear 
logic, logic in artificial intelligence, logic programming,  logical aspects of bioinformatics, 
logical aspects of computational complexity, logical aspects of quantum computation, logical 
frameworks,  logics of programs, modal and temporal logics, model checking, probabilistic systems, 
process calculi, programming language semantics, proof theory, real-time systems, reasoning about 
security, rewriting, type systems and type theory, and verification.


Important Dates:
------------
January   6, 2012: Titles & Short Abstracts Due
January 13, 2012: Extended Abstracts  Due
March   25, 2012: Author Notification (approximate)
April     29, 2012: Final Versions Due for Proceedings:

Authors are required to submit a paper title and a short abstract of about 100 words in advance of 
submitting the extended abstract of the paper.

At committee discretion, authors will be asked to respond to inquiries in February or  March.
Deadlines are firm; late submissions will not be considered.
All submissions will be electronic via
      http://easychair.org/conferences/?conf=lics2012.


Submission Instructions:
------------
Every extended abstract must be submitted in the IEEE Proceedings 2-column 10pt format and may not 
be longer than 10 pages, including references.  LaTeX style files are available on the conference 
website.

The extended abstract must be in English and provide sufficient detail to allow the program 
committee to assess the merits of the paper.  It should begin with a succinct statement of the 
issues, a summary of the main results, and a brief explanation of their significance and relevance 
to the conference and to computer science, all phrased for the non-specialist.
Technical development directed to the specialist should follow. References and comparisons with 
related work must be included.
(If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, 
to be consulted at the discretion of program committee members.) Extended abstracts not conforming 
to the above requirements will be rejected without further consideration.
There is no a priori limit on acceptances; all quality papers will be published, regardless of 
popularity of topic.

Results must be unpublished and not submitted for publication elsewhere, including the proceedings 
of other symposia or workshops.The program chair must be informed, in advance of submission, of 
any closely related work submitted or about to be submitted to a conference or journal.

Authors of accepted papers are expected to sign copyright release forms.  One author of each 
accepted paper is expected to present it at the conference.


Short Presentations:
------------
A session of short presentations, intended for descriptions of student research, works in progress,
and other brief communications, is planned.   These abstracts will not be published. Dates and
guidelines are posted on the LICS website.


Special Events:
------------
- Invited plenary lecture by Robert J. Aumann, winner of the 2005
   Nobel Prize in Economic Sciences.
- Two plenary sessions in honor of Alan Turing on the occasion of his centenary, featuring talks by
   Robert L. Constable, E. Allen Emerson, Joan Feigenbaum, and Leonid Levin.
- Pre-conference tutorials on Sunday, June 24,  by
   * Jan Willem Klop (rewriting systems) and
   * André Platzer (logic of dynamical systems).
- Associated workshops on Sunday, June 24, and on Friday, June 29.


Kleene Award for Best Student Paper:
------------
An award in honor of the late Stephen C. Kleene will be given for the
best student paper(s), as judged by the program committee.

Special Issues:
------------
Full versions of up to three accepted papers, to be selected by the program 
committee, will be invited
for submission to the Journal of the ACM. Additional selected papers will be 
invited to a special issue of
Logical Methods in Computer Science.


Program Chair:
-----------
Nachum Dershowitz, Tel Aviv University

Program Committee:
------------
Christel Baier, Dresden Univ. of Technology
Lev Beklemishev, Steklov Inst of Mathematics
Andreas Blass, Univ. of Michigan
Manuel Bodirsky, École Polytechnique
Mikolaj Bojanczyk, Warsaw Univ.
Ahmed Bouajjani, Univ. Paris Diderot
Patricia Bouyer-Decitre, CNRS
Andrei Bulatov, Simon Fraser Univ.
Hubert Comon-Lundh, ENS Cachan
Anuj Dawar, Univ. of Cambridge
Gilles Dowek, INRIA
Martín Escardó, Univ. of Birmingham
Maribel Fernández, King's College London
Rob van Glabbeek, NICTA
Rosalie Iemhoff, Utrecht Univ.
Neil Immerman, UMass, Amherst
Max Kanovich, Queen Mary, Univ. of London
Naoki Kobayashi, Tohoku Univ.
Orna Kupferman, Hebrew Univ.
Marta Kwiatkowska, Univ. of Oxford
Olivier Laurent, CNRS -- ENS Lyon
Richard Mayr, Univ. of Edinburgh
Andrzej Murawski, Univ. of Leicester
David Plaisted, Univ. North Carolina, Chapel Hill
Davide Sangiorgi, Univ. of Bologna


Conference Chairs:
------------
Vlatko Lipovac, Univ. of Dubrovnik
Andre Scedrov, Univ. of Pennsylvania

Workshop Chairs:
------------
Adriana Compagnoni, Stevens Inst. of Technology
Maribel Fernáandez, King's College London

Publicity Chairs:
-------------
Stephan Kreutzer, Berlin Univ. of Technology
Andrzej Murawski, Univ. of Leicester

Treasurer:
--------
Martín Escardó, Univ. of Birmingham

General Chair:
-----------
Rajeev Alur, Univ. of Pennsylvania

Organizing Committee:
------------
M. Abadi, R. Alur (chair), F. Baader, P. Beame, S. Buss, E. Clarke,
A. Compagnoni, N. Dershowitz, M. Escard'o, M. Fern'andez, L. Fortnow,
J. Giesl, M. Grohe, J.-P. Jouannaud, P. Kolaitis, S. Kreutzer, B. Larose, V. 
Lipovac,
J. Makowsky, B. Monien, A. Murawski, A. Scedrov,
P. Scott, M. Valeriote


Advisory Board:
------------
M. Abadi, S. Abramsky, Y. Gurevich, T. Henzinger, C. Kirchner, P. Kolaitis, D. 
Kozen, U. Martin,
J. Mitchell, L. Ong, L. Pacholski, P. Panangaden, G. Plotkin, A. Scedrov, M. 
Vardi,
G. Winskel



Sponsorship:
----------
The symposium is sponsored by the IEEE Technical Committee on
Mathematical Foundations of Computing and by ACM SIGACT,
in cooperation with the Association for Symbolic Logic and the
European Association for Theoretical Computer Science.

Please see the LICS website url{http://informatik.hu-berlin.de/lics/lics12 for 
further information.