Newsletter 130
1 February 2011

* Past issues of the newsletter are available at
* Instructions for submitting an announcement to the newsletter
  can be found at
* To unsubscribe, send an email with "unsubscribe" in the
  body to

  Deadlines within the next six weeks
  LACL 2011 - Final Call for Papers
  CALCO 2011 - Final Call for Papers
  MFPS XXVII - Call for Papers
  CSL 2011 - Call for Papers
  CONCUR 2011 - Call for Papers
  FCT 2011 - Call for Papers
  CLIMA XII - Call for Papers
  TACL 2011 - Call for Papers
  NCMA 2011 - Call for Paper
  Spring School on Games
  Programme on Constraint Satisfaction, Fields Institute, Toronto
  Ackermann Award 2011 - Call for Nominations
  Lectures in Game Theory for Computer Scientists by Apt and Graedel (Eds.)
  Hybrid Logic and its Proof-Theory by Brauener
  Algorithmic Randomness and Complexity by Downey and Hirschfeldt

* LACL 2011
* CALCO 2011
* CSL 2011
* CONCUR 2011
* FCT 2011
* TACL 2011
* NCMA 2011 - Call for Paper

  Thursday 17th and Friday 18th March 2011,
  Ljubljana, Slovenia.
  The aim of the workshop is to bring together researchers investigating
  computational effects from a variety of different angles: programming
  languages, type theory, operational semantics, universal algebra,
  category theory, denotational semantics, etc.
  A limited number of slots are available for contributed talks. Please
  submit a title and short text abstract by email to
  by the deadline of Thursday 27th January 2011. Notification of
  acceptance will be by Monday 7th February 2011.
  Nick Benton, Microsoft Research, Cambridge
  Andrzej Filinski, Copenhagen University
  Ohad Kammar, University of Edinburgh
  Paul Blain Levy, University of Birmingham
  Paul-Andre Mellies, Paris 7
  Rasmus Ejlers Møgelberg, IT University of Copenhagen
  Eugenio Moggi, University of Genova
  Gordon Plotkin, University of Edinburgh
  John Power*, University of Bath
  Matija Pretnar, University of Ljubljana
  Sam Staton*, University of Cambridge
  Janis Voigtlaender*, University of Bonn
  *to be confirmed
  Andrej Bauer, University of Ljubljana
  Matija Pretnar, University of Ljubljana
  Alex Simpson, University of Edinburgh

  June 29th, 30th and July 1st
  LIRMM, Montpellier, France
* Proceedings will be published as a volume of the FoLLI LNAI subline
  of LNCS
  LACL'2011 is the 6th edition of a series of international conferences
  on logical and formal methods in computational linguistics. It
  addresses in particular the use of type theoretic, proof theoretic and
  model theoretic methods for describing natural language syntax and
  semantics, as well as the implementation of natural language
  processing software relying on such models. It will be held at the
  LIRMM, Montpellier, France. It will be co-located with TALN, the
  conference of the French association for NLP (ATALA).
* Topics:
  Computer scientists, linguists, mathematicians and philosophers are
  invited to present their work on the use of logical methods in
  computational linguistics and natural language processing, in natural
  language analysis, generation or acquisition.
  - logical foundation of syntactic formalisms
         o categorial grammars
         o minimalist grammars
         o dependency grammars
         o tree adjoining grammars
         o model theoretic syntax
         o formal language theory for natural language processing
         o data-driven approaches
  - logic for semantics of lexical items, sentences, discourse and dialog
         o discourse theories
         o Montague semantics
         o compositionality
         o dynamic logics
         o game semantics
         o situation semantics
         o generative lexicon
         o categorical semantics
  - applications of these models to natural language processing
         o software for natural language analysis
         o software for acquiring linguistic resources
         o software for natural language generation
         o software for information extraction
         o inference tasks
         o evaluation
         o scalability
  Articles should be written in the LaTeX format of LNCS/LNAI by
  Springer (see authors instructions at and
  should not exceed 16 pages (including figures, bibliography, possible
  apendices). It is expected that each accepted paper be presented at
  the meeting by one of its authors.
  Papers must be submitted electronically in PDF format at
  Paper submission deadline:      February 6th 2011
  Notification of acceptance:     March 25th 2011
  Camera-ready papers due:        April 10th 2011
  LACL conference:                June 29th, 30th and July 1st 2011

  Call for Papers
  August 29 - September 2, 2011
  Winchester, UK
* SCOPE --
  CALCO aims to bring together researchers and practitioners with
  interests in foundational aspects, and both traditional and emerging
  uses of algebras and coalgebras in computer science.
  This is a high-level, bi-annual conference formed by joining the
  forces and reputations of CMCS (the International Workshop on
  Coalgebraic Methods in Computer Science), and WADT (the Workshop on
  Algebraic Development Techniques). Previous CALCO editions took place
  in Swansea (Wales, 2005), Bergen (Norway, 2007) and Udine (Italy,
  2009). The fourth edition will be held in the city of Winchester
  (England), a historic cathedral city and the ancient capital of Wessex
  and the Kingdom of England.
  Vincent Danos (UK)
  Javier Esparza (Germany)
  Philippa Gardner (UK)
  Gopal Gupta (USA)
  We invite submissions of technical papers that report results of
  theoretical work on the mathematics of algebras and coalgebras, the
  way these results can support methods and techniques for software
  development, as well as experience with the transfer of the resulting
  technologies into industrial practice. We encourage submissions in
  topics included or related to those listed below.
   * Abstract models and logics
    - Automata and languages
    - Categorical semantics
    - Modal logics
    - Relational systems
    - Graph transformation
    - Term rewriting
    - Adhesive categories
   * Specialised models and calculi
  - Hybrid, probabilistic, and timed systems
  - Calculi and models of concurrent, distributed, mobile, and
    context-aware computing
  - General systems theory and computational models (chemical,
    biological, etc)
 * Algebraic and coalgebraic semantics
  - Abstract data types
  - Inductive and coinductive methods
  - Re-engineering techniques (program transformation)
  - Semantics of conceptual modelling methods and techniques
  - Semantics of programming languages
 * System specification and verification
  - Algebraic and coalgebraic specification
  - Formal testing and quality assurance
  - Validation and verification
  - Generative programming and model-driven development
  - Models, correctness and (re)configuration of
  - Process algebra
  Abstract submission:    February 6, 2011
  Paper submission:       February 13, 2011
  Author notification:    April 20, 2011
  Final version due:      May 18, 2011
  Jiri Adamek (Technical University of Braunschweig, Germany)
  Lars Birkedal (IT University of Copenhagen, Denmark)
  Filippo Bonchi (INRIA Saclay, France)
  Corina Cirstea (University of Southampton, UK)
  Andrea Corradini (co-chair, University of Pisa, Italy)
  Maribel Fernandez (King's College London, UK)
  Jose Fiadeiro (University of Leicester, UK)
  H. Peter Gumm (Philipps University Marburg, UK)
  Ichiro Hasuo (Kyoto University, Japan)
  Bart Jacobs (Radboud University Nijmegen, The Netherlands)
  Bartek Klin (co-chair, University of Warsaw, Poland)
  Barbara Koenig (University of Duisburg-Essen, Germany)
  Alexander Kurz (University of Leicester, UK)
  Marina Lenisa (University of Udine, Italy)
  Jose Meseguer (University of Illinois, Urbana-Champaign, USA)
  Ugo Montanari (University of Pisa, Italy)
  Larry Moss (Indiana University, Bloomington, USA)
  Till Mossakowski (DFKI Lab Bremen and University of Bremen, Germany)
  Catuscia Palamidessi (INRIA Saclay, France)
  Dusko Pavlovic (Kestrel Institute, USA)
  John Power (University of Bath, UK)
  Jan Rutten (CWI and Radboud University Nijmegen, The Netherlands)
  Sam Staton (University of Cambridge, UK)
  Lutz Schroeder (DFKI Lab Bremen and University of Bremen, Germany)
  Andrzej Tarlecki (Warsaw University, Poland)
  Yde Venema (University of Amsterdam, The Netherlands)
  Martin Wirsing (Ludwig-Maximilians-University Munich, Germany)
  Corina Cirstea (University of Southampton, UK)
  Dirk Pattinson (Imperial College London, UK)
  Toby Wilkinson (University of Southampton, UK)
  CALCO 2011 will be preceded by the CALCO Young Researchers Workshop,
  CALCO-Jnr, dedicated to presentations by PhD students and by those who
  completed their doctoral studies within the past few years.
  A workshop dedicated to tools based on algebraic and/or coalgebraic
  principles, CALCO-Tools, will be held on the same dates as the main
  CALCO conference.
  There are separate submission procedures for CALCO-Jnr and CALCO-Tools.
  Queries related to submission, reviewing, and programme should be sent
  to the relevant PC chairs.
  Queries related to the organisation should be emailed to

              Second CALL FOR PAPERS
             Carnegie Mellon University
            Pittsburgh, Pennsylvania, USA
               25 May - 28 May 2011

* The Twenty-seventh Conference on the Mathematical Foundations of
  Programming Semantics will take place on the campus of Carnegie Mellon
  University, Pittsburgh, PA from 25 May to 28 May 2011. MFPS
  conferences are devoted to those areas of mathematics, logic, and
  computer science that are related to models of computation, in
  general, and to the semantics of programming languages, in
  particular. The series has particularly stressed providing a forum
  where researchers in mathematics and computer science can meet and
  exchange ideas about problems of common interest. As the series also
  strives to maintain breadth in its scope, the conference strongly
  encourages participation by researchers in neighbouring areas.
* TOPICS include, but are not limited to, the following:
  biocomputation; concurrent qualitative and quantitative distributed
  systems; process calculi; probabilistic systems; constructive
  mathematics; domain theory and categorical models; formal languages;
  formal methods; game semantics; lambda calculus; programming-language
  theory; quantum computation; security; topological models; logic; type
  systems; type theory. We also welcome contributions that address
  applications of semantics to novel areas such as complex systems,
  markets, and networks, for example.
  Stephen Brookes, CMU
  Jérôme Feret, INRIA
  John Reynolds, CMU
  Alex Simpson, Edinburgh
  Stephanie Weirich, Penn
  Steve Zdancewic, Penn
  - A Special Session Honouring John Reynolds on his 75th birthday,
    organised by Stephen Brookes (CMU) and Peter O~Hearn (QMW, London).
  - A Special Session on Systems Biology, held in conjunction Jérôme
    Feret~s plenary talk, and organised by Jean Krivine (Paris VII &
  - A Special Session on Security, held in conjunction with Steve
    Zdancewic~s plenary talk, and organised by Catherine Meadows (NRL).
* TUTORIALS: There will be four tutorials on Programs from Proofs that
  will be given during the course of the meeting. The lectures are
  organised by Martin Escardó and Achim Jung (Birmingham). The speakers
  include Ulrich Berger (Swansea), Martin Escardó (Birmingham), Paolo
  Oliva (Queen Mary), and Monika Seisenberger (Swansea).
 Amal Ahmed, Indiana U, USA
 Lars Birkedal, ITU, Denmark
 Stephen Brookes, Carnegie Mellon U, USA
 Corina Cirstea, U Southampton, UK
 Bob Coecke, U Oxford, UK
 Véronique Cortier, CNRS / Loria, France
 Vincent Danos, U Edinburgh, UK
 Anupam Datta, Carnegie Mellon U, USA
 Josée Desharnais, U Laval, Canada
 Philippa Gardner, Imperial College, UK
 Dan Ghica, U Birmingham, UK
 Jane Hillston, U Edinburgh, UK
 Bart Jacobs, Radboud U, Netherlands
 Achim Jung, U Birmingham, UK
 Jean Krivine, Paris 7 & CNRS, France
 Catherine Meadows, NRL, USA
 Michael Mislove, Tulane U, USA
 Peter O'Hearn, Queen Mary, U London, UK
 Joël Ouaknine, U Oxford, UK (Chair)
 Catuscia Palamidessi, INRIA, France
 Prakash Panangaden, McGill U, Canada
 Grigore Rosu, U Illinois, USA
 Davide Sangiorgi, U Bologna, Italy
 Peter Sewell, U Cambridge, UK
 Gianluigi Zavattaro, U Bologna, Italy
 - 21 February 2011      Title and Short Abstract submission deadline
 - 28 February 2011      Paper submission deadline
 - 31 March 31 2011      Notification to authors
 - 15 April 15 2011      Preliminary proceedings version due
* SUBMISSIONS should be prepared using ENTCS Macros, available from Submissions should be in the form of a PDF file
  not exceeding 15 pages in length. Submissions are now open on the
  EasyChair website:
* PROCEEDINGS: There will be a preliminary proceedings of the
  conference papers that will be distributed at the meeting, with a
  final proceedings published in ENTCS after the meeting.
* The Organisers of the MFPS series are Stephen Brookes (CMU), Achim
  Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane)
  and Prakash Panangaden (McGill). The local arrangements for MFPS XXVII
  are being overseen by Stephen Brookes (CMU).

 Call for papers and workshop proposals
 September 12-15, 2011, Bergen, Norway
* Computer Science Logic (CSL) is the annual conference of the
 European Association for Computer Science Logic (EACSL).
 The conference is intended for computer scientists whose
 research activities involve logic, as well as for logicians
 working on issues significant for computer science.
 Original research papers are called for, for more information,
* Topics of interest include (but are not limited to):
 automated deduction and interactive theorem proving,
 constructive mathematics and type theory,
 equational logic and term rewriting,
 automata and games, game semantics,
 modal and temporal logic,
 model checking,
 decision procedures,
 logical aspects of computational complexity,
 finite model theory, computational proof theory,
 logic programming and constraints,
 lambda calculus and combinatory logic,
 categorical logic and topological semantics,
 domain theory, database theory,
 specification, extraction and transformation of programs,
 logical foundations of programming paradigms,
 logic and quantum computing,
 verification and program analysis,
 linear logic,
 higher-order logic,
 nonmonotonic reasoning.
* Proposals for satellite workshops on more specialized topics are
 welcome and can be sent to
* Important dates:
 Submission of title and abstract:       March 27, 2011
 Submission of full paper:                April 3, 2011
 Notification:                             May 30, 2011
 Final paper due:                         June 17, 2011
 Conference:                      September 12-15, 2011
* Program Committee:
 Samson Abramsky (Oxford)
 Andrea Asperti (Bologna)
 Franz Baader (Dresden)
 Matthias Baaz (Vienna)
 Johan van Benthem (Amsterdam/Stanford)
 Marc Bezem (Bergen, chair)
 Patrick Blackburn (Nancy)
 Andreas Blass (Michigan)
 Jan van den Bussche (Hasselt)
 Thierry Coquand (Gothenburg)
 Nachum Dershowitz (Tel Aviv)
 Valentin Goranko (Copenhagen)
 Erich Gradel (Aachen)
 Wiebe van der Hoek (Liverpool)
 Bart Jacobs (Nijmegen)
 Reinhard Kahle (Lisbon)
 Stephan Kreutzer (Oxford)
 Viktor Kuncak (Lausanne)
 Daniel Leivant (Indiana)
 Benedikt Loewe (Amsterdam)
 Jean-Yves Marion (Nancy)
 Eugenio Moggi (Genova)
 Albert Rubio (Barcelona)
 Anton Setzer (Swansea)
 Alex Simpson (Edinburgh)
 John Tucker (Swansea)
 Pawel Urzyczyn (Warsaw)
 Helmut Veith (Vienna)
 Andrei Voronkov (Manchester)

                       First Call for Papers
          September 6 - September 9, 2011, Aachen, Germany
* The purpose of the CONCUR conferences is to bring together researchers,
  developers, and students in order to advance the theory of concurrency,
  and promote its applications.
* Submissions are solicited in semantics, logics, verification and
  analysis of concurrent systems. The principal topics include (but are
  not limited to):
  - Basic models of concurrency such as abstract machines, domain
   theoretic models, game theoretic models, process algebras,
   graph transformation systems and Petri nets;
  - Logics for concurrency such as modal logics, probabilistic and
   stochastic logics, temporal logics, and resource logics;
  - Models of specialized systems such as biology-inspired systems,
   circuits, hybrid systems, mobile and collaborative systems,
   multi-core processors, probabilistic systems, real-time systems,
   service-oriented computing, and synchronous systems;
  - Verification and analysis techniques for concurrent systems such as
   abstract interpretation, atomicity checking, model checking, race
   detection, pre-order and equivalence checking, run-time verification,
   state-space exploration, static analysis, synthesis, testing, theorem
   proving, and type systems;
  - Related programming models such as distributed, component-based,
   object-oriented, and web services.
  - Parosh Aziz Abdulla (Uppsala University, Sweden)
  - Ursula Goltz (Technical University Braunschweig, Germany)
  - Rachid Guerraoui (EPFL Lausanne, Switzerland)
  - Wil van der Aalst (Technical University Eindhoven, The Netherlands)
  - 8th Int. Conference on Quantitative Evaluation of SysTems (QEST 2011)
  - 6th Int. Symposium on Trustworthy Global Computing (TGC 2011)
  - There will be co-located workshops, which take place on September 5
    and September 10, and tutorials (associated with QEST) on September
  CONCUR 2011 solicits high quality papers reporting research results
  and/or experience reports related to the topics mentioned above. All
  papers must be original, unpublished, and not submitted for publication
  elsewhere.  Contributions should be submitted electronically as PDF,
  using the Springer LNCS style. Papers should not exceed 15 pages in
  Abstract Submission:     April 1, 2011
  Paper Submission:        April 8, 2011
  Paper Notification:      May 25, 2011
  Camera Ready Copy Due:   June 10, 2011
  CONCUR 2011:             September 6 - September 9, 2010
  - Joost-Pieter Katoen (RWTH Aachen University, Germany)
  - Barbara König (University of Duisburg-Essen, Germany)
  - Christel Baier (TU Dresden, Germany)
  - Paolo Baldan (University of Padova, Italy)
  - Ahmed Bouajjani (University Paris Diderot, France)
  - Franck van Breugel (York University, Toronto, Canada)
  - Roberto Bruni (University of Pisa, Italy)
  - Rocco De Nicola (University of Florence, Italy)
  - Dino Distefano (Queen Mary University of London and Monoidics Ltd, UK)
  - Javier Esparza (TU Munich, Germany)
  - Yuxi Fu (Shanghai Jiaotong University, China)
  - Paul Gastin (ENS de Cachan, Paris, France)
  - Keijo Heljanko (Aalto University, Espoo, Finland)
  - Anna Ingolfsdottir (Reykjavik University, Iceland)
  - Maciej Koutny (Newcastle University, UK)
  - Antonin Kucera (Masaryk University, Brno, Czech Republic)
  - Gerald Lüttgen (Otto-Friedrich-Universität Bamberg, Germany)
  - Bas Luttik (Eindhoven University of Technology, The Netherlands)
  - Madhavan Mukund (Chennai Mathematical Institute, India)
  - Ernst-Rüdiger Olderog (Universität Oldenburg, Germany)
  - Joel Ouaknine (University of Oxford, UK)
  - Jan Rutten (CWI Amsterdam and Radboud University Nijmegen,
               The Netherlands)
  - Vladimiro Sassone (University of Southampton, UK)
  - Marielle Stoelinga (University of Twente, Enschede, The Netherlands)
  - Irek Ulidowski (University of Leicester, UK)
  - Björn Victor (Uppsala University, Sweden)
  - Mahesh Viswanathan (University of Illinois, Urbana-Champaign, USA)
  - Andrzej Wasowski (IT University of Copenhagen, Denmark)

                              Call for Papers
                    August 22-25, 2011, Oslo, Norway
* The Symposium on Fundamentals of Computation Theory was established
  in 1977 for researchers interested in all aspects of theoretical
  computer science, as well as new emerging fields such as
  bio-inspired computing.  It is a biennial series of conferences
  previously held in Poznan (Poland, 1977), Wendisch-Rietz (Germany,
  1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus
  (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989),
  Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden
  (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga
  (Latvia, 2001), Malmo (Sweden, 2003), Lubeck (Germany, 2005),
  Budapest (Hungary, 2007), and Wroclaw (Poland, 2009).
  The conference  proceedings will be published  (as usual) in the Lecture
  Notes in Computer Science series of Springer-Verlag (to be confirmed).
* SUBMISSIONS (topics)
  Authors are invited to submit papers presenting original unpublished
  research in all areas of theoretical computer science.  Topics of interest
  include (but not limited to):
   - Algorithms:
         o algorithm design and optimization
         o combinatorics and analysis of algorithms
         o computational complexity
         o approximation, randomized, and heuristic methods
         o parallel and distributed computing
         o circuits and boolean functions
         o online algorithms
         o machine learning and artificial intelligence
         o computational geometry
         o computational algebra
   - Formal methods:
         o algebraic and categorical methods
         o automata and formal languages
         o computability and nonstandard computing models
         o database theory
         o foundations of concurrency and distributed systems
         o logics and model checking
         o models of reactive, hybrid and stochastic systems
         o principles of programming languages
         o program analysis and transformation
         o specification, refinement and verification
         o security
         o type systems
   - Emerging fields:
         o ad hoc, dynamic, and evolving systems
         o algorithmic game theory
         o computational biology
         o foundations of cloud computing and ubiquitous systems
         o quantum computation
  Submission Deadline:          Tuesday,  5.  April 2011
  Author Notification:          Monday,   6.  June  2011
  Camera ready manuscript:      Friday   17.  June  2011
* For further information on the conference, please visit the URL at
  - Olaf Owe          (U. of Oslo)
  - Martin Steffen    (U. of Oslo)
  - Jan Arne Telle    (U. of Bergen)
  Erika Abraham         (RWTH Aachen, Germany)
  Wolfgang Ahrendt      (Chalmers, Sweden)
  David Coudert         (INRIA Sophia-Antipolis, France)
  Camil Demetrescu      (La Sapienza University of Rome, Italy)
  Jiri Fiala            (Charles University, Prague, Czech Republic)
  Martin Hofmann        (LMU, Munich)
  Thore Husfeldt        (IT University of Copenhagen, Denmark)
  Alexander Kurz        (U. of Leicester, UK)
  Andrzej Lingas        (Lund University, Sweden)
  Peter Csaba Oelveczky (U. of Oslo, Norway)
  Olaf Owe              (U. of Oslo, Norway)
  Miguel Palomino       (U. Complutense, Madrid, Spain)
  Yuri Rabinovich       (U. of Haifa, Israel)
  Saket Saurabh         (Inst. of Mathematical Sciences, Chennai, India)
  Martin Steffen        (U. of Oslo, Norway)
  Jan Arne Telle        (U. of Bergen, Norway)
  Tarmo Uustalu         (Inst. of Cybernetics, Tallinn, Estland)
  Ryan Williams         (IBM Almaden Research Center, San Jose, USA)
  Gerhard Woeginger     (U. of Eindhoven, The Netherlands)
  David Wood            (U. of Melbourne, Australia)

    Preliminary Call for Papers
with special sessions on:
          * Norms and Normative Multi-Agent Systems.
          * Logics for Games and Social Choice.
           Barcelona, Spain, July 17-18, 2011.
                 Affiliated with IJCAI'11.
               Submission deadline: April 4/8th.
* The purpose of the CLIMA Workshop Series is to provide a forum for
  discussing techniques, based on computational logic, for representing,
  programming and reasoning about agents and multi-agent systems in a
  formal way.
* Following the previous ten, very successful, editions, the 12th CLIMA
  will be affiliated with IJCAI'11 and will take place in Barcelona, Spain,
  on the 17th and 18th of July 2011.
* In addition to CLIMA's regular topics and sessions, this edition will
  feature two special sessions:
  - Norms and Normative Multi-Agent Systems
  - Logics for Games and Social Choice
* We welcome and encourage the submission of high quality, original
  papers, which have not been accepted for publication nor are currently
  under review for another journal or conference.
* LNCS Proceedings: CLIMA's Proceedings will be published by
  Springer as a volume in the Lecture Notes in Computer Science, and
  will be available in time for the workshop.
* JLC Special Issue: After the workshop, authors of selected papers will
  be invited to extend and re-submit their work to be considered for inclusion
  in a CLIMA Special Issue of the Journal of Logic and Computation.
* Detailed information regarding CLIMA, its topics of interest, the two Special
  Sessions, formatting and submission instructions is available at
* Proceedings: LNCS/LNAI volume (available at the workshop).
  JLC Special Issue: Selected extended papers will be published in a
  Special Issue of the Journal of Logic and Computation.
* Important dates:
  - Submission: April 4th (Abstracts) / April 8th (Papers)
  - Notification: May 4th
   - Camera Ready: May 16th
  João Leite, New University of Lisbon, Portugal
  Paolo Torroni, University of Bologna, Italy
* Special Session Organisers:
  Norms and Normative Multi-Agent Systems:
  - Guido Boella, University of Turin, Italy
  - Leon van der Torre, Univ. of Luxembourg, Luxembourg
  Logics for Games and Social Choice:
  - Thomas Ågotnes, University of Bergen, Norway
* Please send all enquiries about CLIMA XII to

                         26-30 July 2011
              Universités Aix-Marseille I-II-III, France
* The Fifth International Conference on Topology, Algebra and Categories
  in Logic is dedicated to the memory of Leo Esakia (1934-2010).
* Scope
  Studying logics via semantics is a well-established and very active
  branch of mathematical logic, with many applications, in computer
  science and elsewhere. The area is characterized by results, tools
  and techniques stemming from various fields, including universal
  algebra, topology, category theory, order, and model theory. The
  program of the conference TACL 2011 will focus on three
  interconnecting mathematical themes central to the semantical study
  of logics and their applications: algebraic, categorical, and
  topological methods. This is the fifth conference in the series
  Topology, Algebra and Categories in Logic (TACL, formerly TANCL).
  Earlier installments of this conference have been organized in
  Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009).
* Featured topics
  Contributed talks can deal with any topic dealing with the use of
  algebraic, categorical or topological methods in either logic or
  computer science. This includes, but is not limited to, the following
  - Algebraic structures in CS
  - Algebraic logic
  - Coalgebra
  - Categorical methods in logic
  - Domain theory
  - Fuzzy and many-valued logics
  - Lattice theory
  - Lattices with operators
  - Modal logics
  - Non-classical logics
  - Ordered topological spaces
  - Ordered algebraic structures
  - Pointfree topology
  - Proofs and Types
  - Residuated structures
  - Semantics
  - Stone-type dualities
  - Substructural logics
  - Topological semantics of modal logic
* Submissions
  Contributed presentations will be of two types:
  o 20 minutes long presentations in parallel sessions and
  o featured, 30 minutes long, plenary presentations.
  The submission of an abstract will be required to be selected for
  a contributed presentation of either kind. While preference will
  be given to new work, results that have already been published or
  presented elsewhere will also be considered.
* Important dates
  April 18, 2011: Abstract submission deadline
  May 20, 2011:   Notification to authors
  July 26-30, 2011:  Conference
* Program Committee
  Guram Bezhanishvili, New Mexico State University
  Petr Cintula, Academy of Sciences of the Czech Republic
  Thierry Coquand, University of Gothenburg
  Mai Gehrke, Radboud University, Nijmegen
  Silvio Ghilardi, Università degli Studi di Milano
  Rob Goldblatt, Victoria University, Wellington
  Martin Hyland, King's College, Cambridge
  Ramon Jansana, Universitat de Barcelona
  Achim Jung (PC co-chair), University of Birmingham
  Alexander Kurz, University of Leicester
  Yves Lafont, Université Aix-Marseille II
  Tadeusz Litak, University of Leicester
  Paul-André Melliès, CNRS Paris Diderot
  George Metcalfe, Universität Bern
  Nicola Olivetti, Université Aix-Marseille III
  Hiroakira Ono, Japan Advanced Institute of Science and Technology
  Luigi Santocanale, Université Aix-Marseille I
  Kazushige Terui, Kyoto University
  Costantine Tsinakis, Vanderbilt University
  Yde Venema (PC co-chair), University of Amsterdam
  Friedrich Wehrung, Université de Caen
  Michael Zakharyaschev, University of London
* More Information
  If you have any queries please send them to the conference email address:

                     Call for Papers
                   July 18 - 19, 2010.
                     Milano, Italy
* Researchers are invited to submit papers concerning original contributions
  on non-classical models of automata and applications and related subjects
  for NCMA 2011. Many non-classical automata models are natural objects of
  theoretical computer science. They are studied from different points of view
  in various areas, both as theoretical concepts and as formal models for
  applications. The aim of this workshop is to bring together researchers
  working on different aspects of different variants of non-classical automata
  models in order to exchange and develop novel ideas. A deeper and
  interdisciplinary coverage of this particular area may gain new insights
  and substantial progress.
* Topics of NCMA 2011 include, but are not limited to:
  - Bio-inspired Automata
  - Cellular Automata
  - Restarting Automata, Forgetting Automata
  - Automata with Additional Resources
  - Automata Networks, Cooperation, and Communication
  - Quantum Automata
  - Other Formal Models Inspired by:
  - Linguistics
  - Bio-Computing
  - Text Processing
  - Document Engineering
  - Self-Assembling
  In all these settings:
  - Application
  - Expressive Capability
  - Descriptional Complexity
  - Universality, Self-Reproduction
  - Decision Problems and their Complexity
  - Algebraic Properties
* The 3rd International workshop NCMA 2011 will take place in Milano, Italy,
  immediately before DLT 2011 which also will be held in Milano  from July 19
  (afternoon). NCMA 2011 is partially supported by the University of Milan,
  Dipartimento di Scienze dell'informazione, and by Dipartimento di Informatica
  e Comunicazione.  The first workshop was held in Wroclaw, Poland, while the
  second edition took place in Jena, Germany.
  Submission Deadline: April 28, 2010 (11:59pm, Samoan time).
  Notification Deadline: May 27, 2011
  Papers presenting original contributions on non-classical models of automata
  and applications and related subjects are being sought.
  Authors are invited to submit papers of no more than 12 pages in OCG-style
  ( in
  electronic format (PostScript or PDF).  Proofs omitted due to space
  constraints must be put into an appendix to be read by the program committee
  members at their discretion. Simultaneous submission to other conferences
  or workshops with published proceedings is not allowed. All submissions will
  be reviewed by at least three referees. The proceedings volume is expected
  to be published by the Oesterreichischen Computer Gesellschaft in its series and will be available at the workshop. Selected papers
  will be published in a special journal issue (Fundamenta Informaticae,
  for the previous two editions of the workshop). The submissions are handled
  by the EasyChair conference management system. To submit your paper, please
  go to
  Rudolf Freund (Technische Universitaet Wien, Austria)
  Markus Holzer (Universitaet Giessen, Germany)
  Carlo Mereghetti (Universite di Milano, Italy)
  Friedrich Otto (Universitaet Kassel, Germany)
  Beatrice Palano (Universite di Milano, Italy)
  Andris Ambainis (University of Riga, Latvia)
  Viliam Geffert (University of Kosice, Slovak Rep.)
  Christian Choffrut (Universite Paris Diderot, France)
  Erzsebet Csuhaj-Varju (Academy of Sciences, Hungary)
  Mark Daley (University of Western Ontario, Canada)
  Jerome Durand-Lose (Universite d'Orleans, France)
  Rusins Freivalds (University of Riga, Latvia)
  Rudolf Freund (Technische Universitaet Wien, Austria)
  Mika Hirvensalo (University of Turku, Finland)
  Markus Holzer (Universitaet Giessen, Germany)
  Andreas Malcher (Universitaet Giessen, Germany)
  Carlo Mereghetti (University of Milano, Italy)
  Nelma Moreira (University of Porto, Protugal)
  Hidenosuke Nishio (University of Kyoto, Japan)
  Marion Oswald (Technische Universitaet Wien, Austria)
  Friedrich Otto (Universitaet Kassel, Germany)
  Beatrice Palano (University of Milano, Italy)
  Giovanni Pighizzini (University of Milano, Italy)
  Kai Salomaa (Queen's University, Canada)
  Bianca Truthe (Universitaet Magdeburg, Germany)

         May 23 to 27,
    Carcans-Maubuisson, France
* The GAMES-EPIT Spring School 2011 is the 38th School in the series of
  "Ecole de Printemps d'Informatique Théorique"
  ( and is supported by the ESF project
  "GAMES for Design and Verification" (
* Programme
  The school will consist of nine lectures presenting important
  developments in language theory, automata, and games:
  - Basic topology and game determinacy (Jacques Duparc, Lausanne)
  - Basic stochastic games (Hugo Gimbert, Bordeaux)
  - Basics about algebraic approach to languages (Marc Zeitoun, Bordeaux)
  - Stochastic pushdown games (Antonín Ku~era, Brno)
  - Algebraic approach to tree languages (Miko~aj Boja~czyk, Warsaw)
  - Profinite approach to language theory (Jean-Éric Pin, Paris)
  - Games, recursion schemes, and semantics (Luke Ong, Oxford)
  - Automata with counters (Thomas Colcombet, Paris)
  - Automatic structures (Markus Lohrey, Leipzig)
* The lectures are intended to be accessible to a wide audience, but some
  familiarity with automata theory and logic is recommended.
* Date and Venue
  The GAMES-EPIT Spring School 2011 will take place from
  Monday, May 23rd to Friday, May 27th, in France, near Bordeaux, in
* Participation and Registration
  The GAMES-EPIT Spring School 2011 addresses primarily to PhD students and
  young researchers, but more senior participants are also very welcome.
  The number of participants will be limited to 90.
  Participants will have to pay a contribution of 350 Euro to cover
  accommodation, breakfasts, lunches, dinners and coffee breaks for the
  whole duration of the school. Thanks to the sponsorship of CNRS, the
  school is free for full-time CNRS researchers. ESF-GAMES offers a
  number of grants for other participants.
* Registration is accessible through the  web-page of the conference.
* Grants
  The school can offer about 20 grants covering the costs of the
  stay. There will be also a small number of grants for covering travel
  costs. The applications for the two types of grants should be done
  through the school's web-page.
* Deadlines
  Registration with grant: March 7th
  Grant notifications: March 17th
  Registration without grant: April 4th

  July and August 2011,
  Fields Institute, Toronto
* Immediately following the annual LICS meeting in June
  2011, the Fields Institute will host a two-month thematic
  program on the Mathematics of Constraint Satisfaction. The
  program will include a 5-day summer school, three focused
  workshops, the Coxeter Lectures, regular weekly seminars,
  and extended periods of time for in-residence researchers
  and students for intensive study. The program will bring
  together researchers from various communities within pure
  mathematics and theoretical computer science.
* Activities and dates:
 - June 26-30, 2011: Fields Summer School
 - July 11-13, 2011: The Coxeter Lectures (Moshe Y. Vardi, Rice University)
 - July 11-15, 2011: Workshop on Graph Homomorphisms
 - August 2-6, 2011: Workshop on Algebra and CSPs
 - August 15-19, 2011: Workshop on Approximability of CSPs
* All scientific events are open to the mathematical sciences community, but
 visitors are requested to indicate their interest in participating in some or
 all of the planned events by filling out the information form found on the
 program website.
* Requests for support may be submitted at any time by filling out the
 application form found on the program website.  The organizing committee will
 start to review requests in late February of 2011.

* Eligible for the 2011 Ackermann Award are PhD dissertations in topics
  specified by the EACSL and LICS conferences, which were formally
  accepted as PhD theses at a university or equivalent institution
  between 1.1.2009 and 31.12. 2010.
* Submission details are available at
* The deadline for submission is March 15, 2011
* Nominations should be sent to the secretary of the Jury by
* The award consists of
  - a diploma,
  - an invitation to present the thesis at the CSL conference,
  - the publication of the abstract of the thesis and the laudation
    in the CSL proceedings,
  - travel support to attend the conference.
* The 2011 Ackermann Award will be presented to the recipients at the
  annual conference of the EACSL (CSL'11) in Bergen (Norway)
  to be held 12-15 September 2011,
* The jury consists of  8  members:
  - The president of EACSL, D. Niwinski (Warsaw)
  - The vice-president of EACSL, A. Dawar (Cambridge)
  - One member of the LICS Steering Committee,  L. Ong (Oxford)
  - J.-P. Jouannaud (Paris)
  - A. Atserias (Barcelona)
  - T. Coquand (Goeteborg)
  - P.-L. Curien (Paris)
  - W. Thomas (Germany)
* J. Makowsky (Haifa), member of the board of EACSL, will
  act as the secretary of the Jury.
* The jury is entitled to give more (and less) than one award per year.
* The previous Ackermann Award recipients were:
  2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
  2006: Stefan Milius and Balder ten Cate;
  2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang;
  2008: Krishnendu Chatterjee;
  2009: Jakob Nordstrom;
  2010: ---- (The Jury decided that no Award is given).
* For the four years 2010-2013,
  the Ackermann Award is sponsored by the Kurt Goedel Society

  K. Apt and E. Grädel (Eds.)
  Cambridge University Press, 2011
* Games provide mathematical models for interaction. Numerous tasks in
  computer science can be formulated in game-theoretic terms. This fresh
  and intuitive way of thinking through complex issues reveals
  underlying algorithmic questions and clarifies the relationships
  between different domains. This collection of lectures, by specialists
  in the field, provides an excellent introduction to various aspects of
  game theory relevant for applications in computer science that concern
  program design, synthesis, verification, testing and design of
  multi-agent or distributed systems. Originally devised for a Spring
  School organised by the GAMES Networking Programme in 2009, these
  lectures have since been revised and expanded, and range from
  tutorials concerning fundamental notions and methods to more advanced
  presentations of current research topics. This volume is a valuable
  guide to current research on game-based methods in computer science
  for undergraduate and graduate students. It will also interest
  researchers working in mathematical logic, computer science and game

  by Torben Brauener
  Applied Logic Series, Vol. 37
  Springer, 2011
  ISBN 978-94-007-0001-7
* This is the first book-length treatment of hybrid logic
  and its proof-theory. Hybrid logic is an extension of
  ordinary modal logic which allows explicit reference to
  individual points in a model (where the points represent
  times, possible worlds, states in a computer, or something
  else). This is useful for many applications, for example
  when reasoning about time one often wants to formulate a
  series of statements about what happens at specific times.
* There is little consensus about proof-theory for ordinary
  modal logic. Many modal-logical proof systems lack important
  properties and the relationships between proof systems for
  different modal logics are often unclear. In the present
  book we demonstrate that hybrid-logical proof-theory
  remedies these deficiencies by giving a spectrum of
  well-behaved proof systems (natural deduction, Gentzen,
  tableau, and axiom systems) for a spectrum of different
  hybrid logics (propositional, first-order, intensional
  first-order, and intuitionistic).
* All these proof systems can be motivated independently,
  but the fact that the systems can be given in a uniform way
  shows that hybrid logic and hybrid-logical proof-theory is a
  natural enterprise.
* Further information can be found at

  Rodney G. Downey and Denis R. Hirschfeldt
  Springer, November 2010
* Intuitively, a sequence such as 101010101010101010~ does
  not seem random, whereas 101101011101010100~, obtained
  using coin tosses, does. How can we reconcile this intuition
  with the fact that both are statistically equally likely?
  What does it mean to say that an individual mathematical
  object such as a real number is random, or to say that one
  real is more random than another? And what is the
  relationship between randomness and computational power. The
  theory of algorithmic randomness uses tools from
  computability theory and algorithmic information theory to
  address questions such as these. Much of this theory can be
  seen as exploring the relationships between three
  fundamental concepts: relative computability, as measured by
  notions such as Turing reducibility; information content, as
  measured by notions such as Kolmogorov complexity; and
  randomness of individual objects, as first successfully
  defined by Martin-Löf. Although algorithmic randomness has
  been studied for several decades, a dramatic upsurge of
  interest in the area, starting in the late 1990s, has led to
  significant advances. This is the first comprehensive
  treatment of this important field, designed to be both a
  reference tool for experts and a guide for newcomers. It
  surveys a broad section of work in the area, and presents
  most of its major results and techniques in depth. Its
  organization is designed to guide the reader through this
  large body of work, providing context for its many concepts
  and theorems, discussing their significance, and
  highlighting their interactions. It includes a discussion of
  effective dimension, which allows us to assign concepts like
  Hausdorff dimension to individual reals, and a focused but
  detailed introduction to computability theory. It will be of
  interest to researchers and students in computability
  theory, algorithmic information theory, and theoretical
  computer science.
* This is is the first book in the new CiE book series
  "Theory and Applications of Computability".
* Further information can be found at

Back to the LICS web page.