Newsletter 120
January  7, 2009

* 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
  subject line to

  Upcoming deadlines, LICS abstract deadline next week!
  LICS 2009 - Call for Papers
  CIE 2009 - Second Call for Papers
  TABLEAUX 2009 - Final Call for Papers
  CADE 2009 - Second Call for Papers
  SAT 2009 - Second Call for Papers
  ICLP 2009 - Call for Papers
  TARK XII - Call for Papers
  M4M-6 - Call for Papers

* LICS 2009
* CAV 2009
* RTA 2009
* CIE 2009
* CSF 2009
* ICALP 2009
* CCC 2009
* CADE 2009
* SAT 2009
* ICLP 2009
* WOLLIC 2009
* WOLLIC 2009

   Call for Papers
   August  11--14, 2009,
   Los Angeles, California, USA
* Colocated with the 16th International
  Static Analysis Symposium (SAS 2009),
  August 9--11
* 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 for
  submissions include: automata theory, automated deduction, categorical
  models and logics, concurrency and distributed computation, constraint
  programming, constructive mathematics, database theory, domain theory,
  finite model theory, formal aspects of program analysis, formal
  methods, higher-order logic, hybrid systems, lambda and combinatory
  calculi, linear logic, logical aspects of computational complexity,
  logical frameworks, logics in artificial intelligence, logics of
  programs, logic programming, modal and temporal logics, model
  checking, probabilistic systems, process calculi, programming language
  semantics, proof theory, reasoning about security, rewriting, type
  systems and type theory, and verification.  We welcome submissions in
  emergent areas, such as bioinformatics and quantum computation, if
  they have a substantial connection with logic.
* Submission information:
  Authors are required to submit a paper title and a short abstract of
  about 100 words before submitting the extended abstract of the
  paper. All submissions will be electronic.
  All deadlines are firm; late submissions will not be considered.
  Submission is open at
* Important Dates:
  Titles & Short Abstracts Due:  January 12, 2009
  Extended Abstracts  Due:       January 19, 2009
  Author Notification:           March 19, 2009
  Camera-ready Papers Due:       May 25, 2009.
* Affiliated Workshops:
  As in previous years, there will be a number of workshops affiliated
  with LICS 2009; information  will be posted at the LICS website.
* Program Chair:
    Andrew Pitts
    Computer Laboratory
    University of Cambridge, UK
* Program Committee:
  Rance Cleaveland, University of Maryland
  Karl Crary, Carnegie Mellon University
  Rocco De Nicola, Univ. degli Studi di Firenze
  Gilles Dowek, École polytechnique
  Neil Immerman, University of Massachusetts
  Radha Jagadeesan, DePaul University
  Claude Kirchner, INRIA
  Marta Kwiatkowska, Oxford University
  Benoit Larose, Concordia University
  Soren Lassen, Google Inc.
  Leonid Libkin, University of Edinburgh
  Paul-André Melliès, CNRS & Univ. Paris Diderot
  Eugenio Moggi, Università di Genova
  Andrzej Murawski, Oxford University
  Gopalan Nadathur, University of Minnesota
  Prakash Panangaden, McGill University
  Madhusudan Parthasarathy, UI Urbana-Champaign
  Nir Piterman, Imperial College London
  Andrew Pitts, University of Cambridge
  François Pottier, INRIA
  Vijay Saraswat, IBM TJ Watson Research Center
  Lutz Schröder, DFKI-Lab Bremen
  Nicole Schweikardt,  Univ Frankfurt am Main
  Alwen Tiu, Australian National University
  Hongseok Yang, Queen Mary Univ. of London
* Conference Chair:
  Jens Palsberg, UCLA
  Los Angeles, California, USA
* Workshops Chairs:
  Adriana Compagnoni, Stevens Inst. of Technology
  Philip J. Scott, University of Ottawa
* Publicity Chairs:
  Stephan Kreutzer, University of Oxford
  Nicole Schweikardt, Universitat Frankfurt am Main
* General Chair:
  Martín Abadi, Microsoft Research Silicon Valley and
              University of California, Santa Cruz
* Organizing Committee:
  M. Abadi (chair), S. Abramsky, G. Ausiello, F. Baader,
  S. Brookes, S. Buss, E. Clarke, A. Compagnoni, H. Gabow, J. Giesl,
  R. Jagadeesan, A. Jeffrey, J.-P. Jouannaud, P. Kolaitis,
  S. Kreutzer, R. E. Ladner, J. A. Makowsky, J. Marcinkowski, L. Ong,
  F. Pfenning, A. M. Pitts, N. Schweikardt, P. Scott, M. Veanes
* Short Presentations:
  LICS 2009 will have a session of short (10 minute) presentations.
  This session is intended for descriptions of work in progress,
  student projects, and relevant research being published elsewhere;
  other brief communications may be acceptable.  Submissions for these
  presentations, in the form of short abstracts (1 or 2 pages long),
  should be entered at the LICS 2009 submission site in a time frame
  to be determined.
* Kleene Award for Best Student Paper:
  An award in honour of the late S. C. Kleene will be given for the
  best student paper, as judged by the program committee.  Details
  concerning eligibility criteria and procedure for consideration for
  this award will be posted at the LICS website.  The program
  committee may decline to make the award or may split it among
  several papers.
* Sponsorship:
  The symposium is sponsored by the IEEE Technical Committee on
  Mathematical Foundations of Computing in cooperation with the
  Association for Symbolic Logic, and the European Association for
  Theoretical Computer Science.

  Second Call for Papers
  July 19 - 24, 2009, Heidelberg, Germany
* CiE 2009 is the fifth in a series of conferences organised by CiE
  (Computability in Europe), a European association of mathematicians,
  logicians, computer scientists, philosophers, physicists and others
  interested in new developments in computability and their underlying
  significance for the real world. Previous meetings took place in
  Amsterdam (2005), Swansea (2006), Siena (2007) and Athens (2008).
* TUTORIALS: Pavel Pudlak, Luca Trevisan.
* INVITED SPEAKERS: Manindra Agrawal, Jeremy Avigad, Phokion Kolaitis,
  Peter Koepke, Andrea Sorbi, Rafael D. Sorkin, Vijay Vazirani.
* SPECIAL SESSIONS on Algorithmic Randomness (E. Mayordomo, W. Merkle),
  Computational Model Theory (J. Knight, A. Morozov), Computation in
  Biological Systems - Theory and Practice (A. Carbone, E. Csuhaj-Varju),
  Optimization and Approximation (M. Halldorsson, G. Reinelt), Philosophical
  and Mathematical Aspects of Hypercomputation (J. Ladyman, P. Welch),
  Relative Computability (R. Downey, A. Soskova)
  Friedrich Eisenbrand, Ekaterina Fokina, Hristo Ganchev, Sergey Goncharov,
  Bjorn Kjos-Hanssen, Russell Miller, Antonio Montalban, Keng Meng Ng,
  Ion Petre, Alberto Policriti, Francisco J. Romero-Campero, Richard Shore,
  Nikolai Vereshchagin, David Westhead.
* CiE 2009 has a broad scope and bridges the gap from the theoretical
  methods of mathematical and meta-mathematical flavour to the applied and
  industrial questions of computational practice. The conference aims to
  bring together researchers who want to explore the historical and
  philosophical aspects of the field.
* We particularly invite papers that build bridges between different parts
  of the research community. Since women are underrepresented in mathematics
  and computer science, we emphatically encourage submissions by female
  authors. The Elsevier Foundation is supporting the CiE conference series
  in the programme "Increasing representation of female researchers in the
  computability community". This programme will allow us to fund child-care
  support, a mentoring system for young female researchers, and also a small
  number of grants for female researchers, covering their registration fees.
* CiE 2009 conference topics include, but not exclusively:
  admissible sets; analog computation; artificial intelligence; automata theory;
  classical computability and degree structures; computability theoretic aspects
  of programs; computable analysis and real computation; computable structures
  and models; computational and proof complexity; computational complexity;
  computational learning and complexity; concurrency and distributed
  computation; constructive mathematics; cryptographic complexity; decidability
  of theories; derandomization; domain theory and computability; dynamical
  systems and computational models; effective descriptive set theory; finite
  model theory; formal aspects of program analysis; formal methods; foundations
  of computer science; games; generalized recursion theory; history of
  computation; hybrid systems; higher type computability; hypercomputational
  models; infinite time Turing machines; Kolmogorov complexity; lambda and
  combinatory calculi; L-systems and membrane computation; mathematical models
  of emergence; molecular computation; natural computing; neural nets and
  connectionist models; philosophy of science and computation; physics and
  computability; probabilistic systems; process algebra; programming language
  semantics; proof mining; proof theory and computability; quantum computing and
  complexity; randomness; reducibilities and relative computation; relativistic
  computation; reverse mathematics; swarm intelligence; type systems and type
  theory; uncertain reasoning; weak arithmetics and applications
* Important dates:  Paper submission due: 20 Jan 2009;
  Notification: 16 Mar 2009; Final revisions: 17 Apr 2009
* PROGRAMME COMMITTEE Klaus Ambos-Spies (Heidelberg, co-chair), Giorgio Ausiello
  (Rome), Andrej Bauer (Ljubljana), Arnold Beckmann (Swansea), Olivier Bournez
  (Nancy), Vasco Brattka (Cape Town), Barry Cooper (Leeds), Anuj Dawar
  (Cambridge), Jacques Duparc (Lausanne), Pascal Hitzler (Karlsruhe), Rosalie
  Iemhoff (Utrecht), Margarita Korovina (Siegen/Novosibirsk), Hannes Leitgeb
  (Bristol), Daniel Leivant (Bloomington), Benedikt Loewe (Amsterdam),
  Giancarlo Mauri (Milan), Elvira Mayordomo (Zaragoza), Wolfgang Merkle
  (Heidelberg, co-chair), Andrei Morozov (Novosibirsk), Dag Normann (Oslo),
  Isabel Oitavem (Lisbon), Luke Ong (Oxford), Martin Otto (Darmstadt),
  Prakash Panangaden (Montreal), Ivan Soskov (Sofia), Viggo
  Stoltenberg-Hansen (Uppsala), Peter van Emde Boas (Amsterdam), Jan van
  Leeuwen (Utrecht), Philip Welch (Bristol), Richard Zach (Calgary)

TABLEAUX 2009, Automated Reasoning with Analytic Tableaux and Related Methods
  Final Call For Papers
  6-10 July 2009, Oslo, Norway
* Tableaux is an annual international meeting on Automated Reasoning with
  Analytic Tableaux and Related Methods.  TABLEAUX 2009 will be collocated
  with FTP 2009, the workshop on First-Order Theorem Proving.
* Topics of interest include (but are not restricted to):
    - analytic tableaux for various logics (theory and applications)
    - related techniques and concepts, e.g., model checking and BDDs
    - related methods (model elimination, sequent calculi,
      connection method, ...)
    - new calculi and methods for theorem proving in classical
      and non-classical logics (modal, description, intuitionistic,
      linear, temporal, many-valued...)
    - systems, tools, implementations and applications.
  Papers about applications are particularly encouraged!
* Invited Speakers:
    - Patrick Blackburn, INRIA Nancy, France
    - Peter Jeavons, Oxford University Computing Laboratory, UK
    - Pierre Wolper, Université de Liege, France
* Important Dates:
    - Workshop & tutorial proposal submission: Friday, 9 January 2009
    - Research paper submission: Monday, 26 January 2009
    - Final Notification: 3 April 2009
* For full details, refer to the webpage.

   McGill University, Montreal, Canada
   August 2-7, 2009
* Submission Deadline: 23 Feb 2009
  CADE is the major forum for the presentation of research in all
  aspects of automated deduction. The conference programme will
  include invited talks, paper presentations, system
  descriptions, workshops, tutorials, and system competitions.
  We invite high-quality submissions on the general topic of
  automated deduction, including foundations, applications,
  implementations and practical experiences.
  - Logics of interest include, but are not limited to
    o propositional, first-order, equational, higher-order,
      classical, description, modal, temporal, many-valued,
      intuitionistic, other non-classical, meta-logics,
      logical frameworks, type theory and set theory.
  - Methods of interest include, but are not limited to
    o saturation, resolution, instance-based, tableaux, sequent
      calculi, natural deduction, term rewriting, decision
      procedures, model generation, model checking, constraint
      solving, induction, unification, proof planning, proof
      checking, proof presentation and explanation.
  - Applications of interest include, but are not limited to
    o program analysis and verification, hardware verification,
      mathematics, natural language processing, computational
      linguistics, knowledge representation, ontology reasoning,
      deductive databases, functional and logic programming,
      robotics, planning, and other areas of AI.
  Konstantin Korovin   The University of Manchester
  Martin Rinard        Massachusetts Institute of Technology
  Mark Stickel         SRI International
  A two-day workshop and tutorial programme will be co-organized
  with the conference. In addition, the annual CADE ATP System
  Competition (CASC) will be held during the conference. Details
  will be published in separate calls and on the conference
  To submit your paper please use the EasyChair submission system
  at this address:
  A paper title and a short abstract of about 100 words must be
  submitted before the paper.
    16  Feb 2009 Abstract submission deadline
    23  Feb 2009 Paper submission deadline
    10  Apr 2009 Notification of paper decisions
    14  May 2009 Camera-ready papers due
    2-3 Aug 2009 Workshops & Tutorials
    4-7 Aug 2009 Conference, including CASC
  Alessandro Armando     Università di Genova
  Franz Baader           Technische Universität Dresden
  Peter Baumgartner      NICTA, Canberra
  Maria Paola Bonacina   Università degli Studi di Verona
  Bernhard Beckert       Universität Koblenz-Landau
  Nikolaj Bjørner        Microsoft Research
  Alessandro Cimatti     Istituto per la Ricerca Scientifica e
                           Tecnologica, Trento
  Silvio Ghilardi        Università degli Studi di Milano
  Jürgen Giesl           RWTH Aachen
  Rajeev Goré            The Australian National University
  Reiner Hähnle          Chalmers University of Technology
  John Harrison          Intel Corporation
  Miki Hermann           École Polytechnique
  Ullrich Hustadt        University of Liverpool
  Katsumi Inoue          National Institute of Informatics, Japan
  Tommi Junttila         Helsinki University of Technology
  Deepak Kapur           University of New Mexico
  Alexander Leitsch      Technische Universität Wien
  Christopher Lynch      Clarkson University
  Claude Marché          INRIA Saclay, Parc Orsay Université
  William McCune         University of New Mexico
  Aart Middeldorp        Universität Innsbruck
  Hans de Nivelle        University of Wroclaw
  Albert Oliveras        Universitat Politècnica de Catalunya
  Lawrence Paulson       University of Cambridge
  Brigitte Pientka       McGill University
  David Plaisted         University of North Carolina
                           at Chapel Hill
  Michaël Rusinowitch    LORIA-INRIA-Lorraine
  Renate Schmidt (Chair) The University of Manchester
  Carsten Schürmann      IT-Universitetet i København
  Aaron Stump            The University of Iowa
  Geoff Sutcliffe        University of Miami
  Cesare Tinelli         The University of Iowa
  Andrei Voronkov        The University of Manchester
  Christoph Weidenbach   Max-Planck-Institut für Informatik
  Conference Chair:              Brigitte Pientka   McGill University
  Workshop & Tutorial Chair:     Aaron Stump        The University of Iowa
  Publicity Chair:               Carsten Schürmann  IT-Universitetet i København
  PC Chair:                      Renate Schmidt     The University of Manchester

  Second Call for Papers
  June 30 - July 3, 2009, Swansea, United Kingdom
* The International Conference on Theory and Applications of
  Satisfiability Testing is the primary annual meeting for researchers
  studying the propositional satisfiability problem (SAT). SAT'09 is
  the twelfth SAT conference. SAT'09 features the SAT competition, the
  the Pseudo-Boolean evaluation, and the MAX-SAT evaluation.
* The topics of the conference span practical and
  theoretical research on SAT and its applications and include, but are
  not limited to, proof systems, proof complexity, search algorithms,
  heuristics, analysis of algorithms, hard instances, randomised
  formulae, problem encodings, industrial applications, solvers,
  simplifiers, tools, case studies and empirical results. SAT is
  interpreted in a rather broad sense: besides propositional
  satisfiability, it includes the domain of quantified boolean
  formulae (QBF), constraints programming techniques (CSP) for
  word-level problems and their propositional encoding and
  particularly satisfiability modulo theories (SMT).
* Important dates:  Abstract submission due: 20 Feb 2009;
  Paper submission: 27 Feb 2009; Notification: 29 Mar 2009.

   Call for Papers
   Pasadena, California, USA, July 14--17, 2009
   ICLP 2009 will be co-located with IJCAI 2009
* Conference Scope
  Since the first conference held in Marseilles in 1982, ICLP has
  been the premier international conference for presenting research in
  logic programming. Contributions are sought in all areas of logic
  programming including but not restricted to:
  - Theory: Semantic Foundations, Formalisms, Non- monotonic Reasoning,
    Knowledge Representation.
  - Implementation: Compilation, Memory Management, Virtual Machines,
  - Environments: Program Analysis,  Transformation, Validation,
    Verification, Debugging, Profiling.
  - Language Issues: Concurrency, Objects, Coordination, Mobility, Higher
    Order, Types, Modes, Programming Techniques.
  - Related Paradigms: Abductive Logic Programming, Inductive Logic
    Programming, Constraint Logic Programming, Answer-Set Programming.
  - Applications: Databases, Data Integration and Federation, Software
    Engineering, Natural Language Processing, Web and Semantic Web,
    Agents, Artificial Intelligence, Bioinformatics.
  In addition to the presentations of accepted papers, the technical
  program will include invited talks, tutorials, a Doctoral Consortium,
  and workshops.
* Submission Details
  The three broad categories for submissions are: (1) technical
  papers, where, for ICLP 2009, specific attention will be given to work
  describing innovative language features leading to better software
  development, verification, and implementation; (2) application papers,
  where the emphasis will be on their impact on the application domain
  as opposed to the advancement of the the state-of-the-art of logic
  programming; and (3) short papers/posters, ideal for presenting and
  discussing current work not yet ready for publication and research
  project overviews.
  All papers must describe original, previously unpublished research,
  and must not simultaneously be submitted for publication elsewhere.
  They must be written in English. Technical and application papers must
  not exceed 15 pages. The limit for short papers is 5 pages.
* Submissions must be in the Springer LNCS format
  ( via the Easychair submission
  system, available at
  All accepted papers will be included in the conference proceedings,
  expected to be published by Springer-Verlag in the LNCS series.
* Important Dates
  Paper registration:          February 27, 2009
  Submission deadline:         March 3, 2009
  Notification of authors:     April 7, 2009
  Camera-ready copy due:       May 5, 2009
* ICLP 2009 Organization
  General Co-Chairs:   Hai-Feng Guo, Gopal Gupta
  Program Co-chairs:   Patricia Hill, David S Warren
* Program Committee
  Annalisa Bossi            Paulo Moura
  Pedro Cabalar             Steve Muggleton
  Mireille Ducasse          Gopalan Nadathur
  Esra Erdem                Lee Naish
  Francois Fages            Enrico Pontelli
  Thom Fruehwirth           Ricardo Rocha
  Maurizio Gabbrielli       Torsten Schaub
  Maria Garcia de la Banda  Terrance Swift
  Michael Hanus             Peter Szeredi
  Patricia Hill (Co-chair)  Mirek Truszczynski
  Katsumi Inoue             Frank Valencia
  Joxan Jaffar              Wim Vanhoof
  Andy King                 David Warren (Co-chair)
  Nicola Leone              Neng-Fa Zhou
  Fangzhen Lin
* Workshops
  The ICLP 2009 program will include several workshops. They are
  perhaps the best places for the presentation of preliminary work,
  novel ideas, and new open problems to a wide and interested audience.
  Workshops also provide a venue for presenting specialized topics and
  opportunities for intensive discussions and project collaboration in
  any areas related to logic programming, including cross-disciplinary
  areas. Workshop proposals by Feb. 3rd, 2009.
* Doctoral Consortium
  The 5th Doctoral Consortium (DC) on Logic Programming provides
  research students with the opportunity to present and discuss their
  research directions, and to obtain feedback from both peers and
  world-renown experts in the field. Accepted participants will receive
  partial financial support to attend the event and the main conference.
  The best paper and presentation from the DC will be given the
  opportunity to present in special session of the main ICLP conference.
* Conference Venue
  ICLP 2009 will be held in conjunction with IJCAI 2009 at the
  Pasadena Convention Center; for more information, see

   July 6-8, 2009
   Stanford University
   Conference web page
* The mission of the TARK conferences is to bring together researchers  from a wide variety of fields, including Artificial Intelligence,
  Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our
  understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include, but are not
  limited to, semantic models for knowledge, belief, and uncertainty, bounded rationality and resource-bounded reasoning, commonsense
  epistemic reasoning, epistemic logic, knowledge and action, applications of reasoning about knowledge and other mental states, belief revision,
  and foundations of multi-agent systems.
* Important dates: submission deadline: March 2, 2009;
  Notification of Authors: April 27, 2009
  Camera ready copy of accepted papers: June 10, 2009
  Strong preference will be given to papers whose topic is of interest to an interdisciplinary audience, and papers should be accessible to such
  an audience; see the web page for details.
* Program committee
  Krzysztof Apt (CWI),
  Johan van Benthem (Amsterdam and Stanford),
  Felix Brandt (Munich),
  Amanda Friedenberg (Arizona State),
  Rica Gonen (Yahoo!),
  Joe Halpern (Cornell),
  Gil Kalai (Hebrew University),
  Daniel Lehmann (Hebrew University),
  Martin Meier (Institute for Economic Analysis, Barcelona),
  Eric Pacuit (Stanford),
  Andres Perea (Maastricht),
  Riccardo Pucella     (Northeastern),
  Olivier Roy (Groningen).
  Burkhard Schipper (UC Davis),
  Sonja Smets (Vrije Universiteit, Brussels),
  Olivier Tercieux (CNRS   and Paris-Jourdan)
* Program chair: Aviad Heifetz (Open University, Israel)

   Copenhagen, Denmark
   November 12-14, 2009
* Scope
  The workshop "Methods for Modalities" (M4M) aims to bring together
  researchers interested in developing algorithms, verification methods
  and tools based on modal logics. Here the term "modal logics" is
  conceived broadly, including temporal logic, description logic,
  guarded fragments, conditional logic, temporal and hybrid logic, etc.
  To stimulate interaction and transfer of expertise, M4M will feature
  a number of invited talks by leading scientists, research
  presentations aimed at highlighting new developments, and submissions
  of system demonstrations.
  We strongly encourage young researchers and students to submit papers,
  especially for experimental and prototypical software tools which are
  related to modal logics.
* More information about the previous editions can be found at
* M4M-6 will be preceded by a two-day mini-course aimed at preparing
  PhD students and other researchers for participation in the workshop.
  The mini-course is associated with the FIRST research school
* Paper Submissions
  Authors are invited to submit papers in the following three categories.
  - Regular papers up to 15 pages, describing original research.
  - System descriptions of up to 12 pages, describing new systems or
    significant upgrades of existing ones.
  - Presentation-only papers, describing work recently published or
    submitted (no page limit). These will not be included in the
    proceedings, but pre-prints or post-prints can be made available to
* Submissions should be made via EasyChair at the following address:
  Final versions of accepted papers will be published online in a volume
  of Elsevier Electronic Notes in Theoretical Computer Science (ENTCS).
  A preliminary version of the proceedings will also be available at the
*Important dates
   Deadline for submissions: August 24, 2009
   Notification: October 5, 2009
   Camera ready versions: October 26, 2009
   Workshop dates: November 12-14, 2009
* Program Committee
  Carlos Areces, INRIA Lorraine
  Lars Birkedal, IT University of Copenhagen
  Patrick Blackburn, INRIA Lorraine
  Thomas Bolander (co-chair), Technical University of Denmark
  Julian Bradfield, University of Edinburgh
  Torben Braüner (co-chair), Roskilde University
  Balder ten Cate, University of Amsterdam
  Stephane Demri, ENS de Cachan
  Hans van Ditmarsch, University of Otago
  Melvin Fitting, City University of New York
  John Gallagher, Roskilde University
  Mai Gehrke, Radboud University Nijmegen
  Silvio Ghilardi, University of Milano
  Valentin Goranko, University of the Witwatersrand
  Rajeev Goré, ANU, NICTA
  Michael R. Hansen, Technical University of Denmark
  Andreas Herzig, IRIT
  Wiebe van der Hoek, University of Liverpool
  Martin Lange, LMU München
  Carsten Lutz, Dresden University of Technology
  Angelo Montanari, University of Udine
  Valeria de Paiva, Cuill Inc.
  Renate Schmidt, University of Manchester
  Thomas Schneider, University of Manchester
  Carsten Schürmann, IT University of Copenhagen
  Gert Smolka, Saarland University
  Anders Søgaard, University of Copenhagen
  Jørgen Villadsen, Technical University of Denmark
  Frank Wolter, University of Liverpool
  Thomas Ågotnes, Bergen University College

Back to the LICS web page.