[Csl03] Call for Participation

• To: types@cis.upenn.edu
• Subject: [Csl03] Call for Participation
• From: csl03 <csl03@logic.at>
• Date: Fri, 4 Jul 2003 13:09:06 +0200 (CEST)
• List-Archive: <http://www.logic.at/pipermail/csl03-calls/>
• List-Help: <mailto:csl03-calls-request@logic.at?subject=help>
• List-Id: Sending calls for CSL03 <csl03-calls.logic.at>
• List-Post: <mailto:csl03-calls@logic.at>
• List-Subscribe: <http://www.logic.at/mailman/listinfo/csl03-calls>, <mailto:csl03-calls-request@logic.at?subject=subscribe>
• List-Unsubscribe: <http://www.logic.at/mailman/listinfo/csl03-calls>, <mailto:csl03-calls-request@logic.at?subject=unsubscribe>
• Sender: csl03-calls-admin@logic.at

            Annual Conference of the European Association for
                        Computer Science Logic
                                and
                    8th Kurt Goedel Colloquium

                           CSL'03 & KGC


         25 August afternoon - 30 August 2003, Vienna, Austria

                       http://www.logic.at/csl03


Computer Science Logic (CSL)  is  the annual conference  of  the European
Association  for  Computer  Science  Logic  (EACSL).    The  Kurt  Goedel
Colloquium  (KGC)   is   the  biennial  conference  of  the  Kurt  Goedel
Society (KGS).   The joint conference is intended for computer scientists
whose  research  activities  involve  logic,  as  well  as  for logicians
working on issues significant for computer science.


 LIST OF ACCEPTED PAPERS

 A Fixed-Point Logic with Symmetric Choice
   (Anuj Dawar and David Richerby)
 A Logic for Probability in Quantum Systems
   (Ron van der Meyden, Manas Patra)
 A Strongly Normalising Curry-Howard correspondence for IZF Set Theory
   (Alexandre Miquel)
 Atomic Cut Elimination for Classical Logic
   (Kai Brünnler)
 Automata on Lempel-Ziv-compressed strings
   (Hans Leiss, Michel de Rougemont)
 Bistability: an extensional characterization of sequentiality.
   (James Laird)
 Calculi of Meta-variables
   (Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi)
 Comparing the succinctness of monadic query languages over finite trees
   (Martin Grohe, Nicole Schweikardt)
 Complexity of Some Problems in Modal and Intuitionistic Calculi
   (Larisa Maksimova and Andrei Voronkov)
 Computational Aspects of $\Sigma$-definability over the Real Numbers
   without the Equality Test
   (Margarita Korovina)
 Concurrent Construction of Proof-Nets
   (Jean-Marc Andreoli, Laurent Mazaré)
 Constraint Satisfaction with Countable Homogeneous Templates
   (Manuel Bodirsky and Jaroslav Nesetril)
 Coping polynomially with numerous but identical elements within planning
   problems.
   (Max Kanovich and Jacqueline Vauzeilles)
 Deciding Monotonic Games
   (Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso)
 Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of
   Sessions
   (Yannick Chevalier, Ralf Kusters, Michael Rusinowitch,
    Mathieu Turuani, Laurent Vigneron)
 Generating all Abductive Explanations for Queries on Propositional Horn
   Theories
   (Thomas Eiter, Kazuhisa Makino)
 Goal-Directed Calculi for Goedel-Dummett Logics
   (George Metcalfe, Nicola Olivetti and Dov Gabbay)
 Henkin models of the partial lambda-calculus
   (Lutz Schröder)
 Logical relation for dynamic name creation
   (Yu ZHANG, David NOWAK)
 Machine Characterizations of the Classes of the W-hierarchy.
   (Yijia Chen and Joerg Flum)
 Modular Semantics and Logics of Classes
   (Bernhard Reus)
 More computation power for a denotational semantics for first order logic
   (C.F.M. Vermeulen)
 Nominal Unification
   (Christian Urban, Andrew Pitts, Murdoch Gabbay)
 On Algebraic Specifications of Abstract Data Types
   (Bakhadyr Khoussainov)
 On Complexity gaps for Resolution-based proof systems
   (Stefan Dantchev and Søren Riis)
 On the Complexity of Existential Pebble Games
   (Phokion G. Kolaitis and Jonathan Panttaja)
 Parity of Imperfection
   (J. C. Bradfield)
 Pebble games on trees
   (Lukasz Krzeszczakowski)
 Positive Games and Persistent Strategies
   (Jacques Duparc)
 Program Complexity of Dynamic LTL Model Checking
   (Detlef Kähler, Thomas Wilke)
 Quantified Constraints: Algorithms and Complexity
   (Ferdinand Boerner, Andrei Bulatov, Peter Jeavons, Andrei Krokhin)
 Refined Complexity Analysis of Cut Elimination
   (Philipp Gerhardy)
 Simple stochastic parity games
   (Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski)
 Strong normalization of the typed $\lambda_{ws}$- calculus
   (René DAVID & Bruno Guillaume)
 The Arithmetical Complexity of Dimension and Randomness
   (John M. Hitchcock, Jack H. Lutz, Sebastiaan A. Terwijn)
 The Commuting V-Diagram: On the Relation of Refinement and Testing
   (Bernhard K. Aichernig)
 The Surprising Power of Restricted Programs and Gödel's Functionals
   (Lars Kristiansen, Paul J. Voda)
 Towards a proof system for admissibility
   (R. Iemhoff)
 Validity of CTL Queries Revisited
   (Marko Samer, Helmut Veith)

Registration is through the Internet:
                 http://www.logic.at/csl03/
The registration fee (400 euro) includes the costs for the conference
dinner, the reception, and a copy of the conference proceedings. The
registration fee does not include the costs for the excursion to Wachau.

INVITED SPEAKERS:

  Sergei Artemov (CUNY, USA) [jointly invited by  CSL'03 & KGC and
       ESSLLI (European Summer School in Logic Language and Information)]

  Bruno Buchberger (Johannes Kepler University, Austria)
  Dov Gabbay (King's College London, England)
  Helmut Veith (Vienna University of Technology, Austria)
  Nikolai Vorobjov (University of Bath, England)
  Andrei Voronkov (University of Manchester, England)

TUTORIALS:

  Verification of infinite state systems
    (Ahmed Bouajjani, University of Paris 7, France)
  Computational epsilon calculus
    (Georg Moser, University of Muenster, Germany, and
     Richard Zach, University of Calgary, Canada)
  Quantifier elimination
    (Nikolai Vorobjov, University of Bath, England)
  Winning strategies and controller synthesis
    (Igor Walukiewicz, University of Bordeaux, France)


INTERNATIONAL PROGRAM COMMITTEE

 Matthias Baaz (chair), Vienna University of Technology
 Arnold Beckmann, Vienna University of Technology
 Lev Beklemishev, Steklov Inst., Moscow / Utrecht Univ.
 Agata Ciabattoni, Vienna University of Technology
 Kousha Etessami, University of Edinburgh, Informatics
 Chris Fermueller, Vienna University of Technology
 Didier Galmiche, LORIA - UHP Nancy
 Harald Ganzinger, Max Plank Institut (Saarbrücken)
 Erich Grädel, Aachen University
 Petr Hajek, Institute for Computer Science, Chech Academy of Science (Prague)
 Martin Hyland, DPMMS , University of Cambridge
 Reinhard Kahle, DI, Universidade Nova de Lisboa
 Helene Kirchner, LORIA CNRS
 Daniel Leivant, Indiana University Bloomington
 Johann Makowsky (co-chair), Technion-IIT, Haifa
 Jerzy Marcinkowski, Wroclaw University
 Franco Montagna, Department of Mathematics, Siena
 Robert Nieuwenhuis, Tech. Univ. Catalonia (Barcelona)
 Michel Parigot, CNRS / Université Paris 7
 Jeff Paris, Manchester University, Mathematics Dept
 Helmut Schwichtenberg, Munich University, Dept. of Mathematics
 Jerzy Tiuryn, Warsaw University

 LOCAL ORGANIZING COMMITTEE

 Matthias Baaz, Chair
 Arnold Beckmann
 Agata Ciabattoni
 Christian Fermüller
 Rosalie Iemhoff
 Norbert Preining
 Sebastiaan Terwijn

 COLOCATED EVENTS

 CoLogNET (23 August)
   Workshop on Logic-based Methods for Information Integration
   See http://www.kr.tuwien.ac.at/colognet_ws/

 GAMES   (30 August - 2 September)
   2nd Annual Workshop of the European Research Training Network
   GAMES (Games and Automata  for Synthesis and Validation).
   See http://www.games.rwth-aachen.de.

• Prev: CDuce public release
• Next: research position in Foundations of Distributed Systems
• Index(es):
  • Main
  • Thread