Computer Science Logic and 8th Kurt Gödel Colloquium
Program

 Preliminary Schedule

[ Monday | Tuesday | Wednesday | Thursday | Friday | Saturday ]

Monday 25.8.
11:00-13:00Registration
13:00-13:10Opening
13:10-14:10Tatiana Rybina, Andrei Voronkov: Fast Infinite-State Model Checking in Integer-Based SystemsInvited Lecture
Session Complexity
14:10-14:40Stefan Dantchev, Søren Riis: On Relativisation and Complexity gap for Resolution-based proof systems
14:40-15:10Max Kanovich, Jacqueline Vauzeilles: Coping Polynomially with Numerous but Identical Elements within Planning Problems
15:10-15:40Coffee Break
Session Aspects of Computability
15:40-16:10Margarita Korovina: Computational Aspects of $\Sigma$-definability over the Real Numbers without the Equality Test
16:10-16:40Yijia Chen, Jörg Flum: Machine Characterizations of the Classes of the W-Hierarchy
16:40-16:50Break
16:50-17:20Lars Kristiansen, Paul J. Voda: The Surprising Power of Restricted Programs and Gödel's Functionals
17:20-17:50Hans Leiß, Michel de Rougemont: Automata on Lempel-Ziv Compressed Strings
Session Advanced Logics
18:00-18:30Ron van der Meyden, Manas Patra: A logic for probability in quantum systems
18:30-19:00Jean-Marc Andreoli, Laurent Mazaré: Concurrent Construction of Proof-Nets
19:00-open endThe annual meeting of the European Association of Computer Science Logic
Tuesday 26.8.
09:00-10:00Bruno Buchberger: Computational Mathematics, Computational Logic, and Symbolic ComputationInvited Lecture
10:00-11:00Georg Moser, Richard Zach: The Epsilon CalculusTutorial I
11:00-11:30Coffee Break
Session Cut Elimination
11:30-12:00Philipp Gerhardy: Refined Complexity Analysis of Cut Elimination
12:00-12:30Kai Brünnler: Atomic Cut Elimination for Classical Logic
12:30-12:40Break
Session Data Types and Unification
12:40-13:10Bakhadyr Khoussainov: On Algebraic Specifications of Abstract Data Types
13:10-13:40Christian Urban, Andrew Pitts, Murdoch Gabbay: Nominal Unification
13:40-15:00Lunch Break
Session Logic and Complexity
15:00-15:30John M. Hitchcock, Jack H. Lutz, Sebastiaan A. Terwijn: The Arithmetical Complexity of Dimension and Randomness
15:30-16:00Larisa Maksimova, Andrei Voronkov: Complexity of Some Problems in Modal and Intuitionistic Calculi
16:00-16:30Coffee Break
Session Applications
16:30-17:00Yannick Chevalier, Ralf Küsters, Michael Rusinowitch, Mathieu Turuani, Laurent Vigneron: Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
17:00-17:30Bernhard K. Aichernig: The Commuting V-Diagram
t.b.a.Sergei Artemov: Back to the Future: Explicit Logic for Computer ScienceInvited Lecture
Wednsday 27.8.
09:00-10:00Georg Moser, Richard Zach: The Epsilon CalculusTutorial II
10:00-11:00Nicolai Vorobjov: Effective quantifier elimination over real closed fieldsTutorial I
11:00-11:30Coffee Break
Session Proof Systems
11:30-12:00George Metcalfe, Nicola Olivetti, Dov Gabbay: Goal-Directed Calculi for Gödel-Dummett Logics
12:00-12:30Rosalie Iemhoff: Towards a proof system for admissibility
12:30-13:00Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi: Calculi of Meta-variables
afternoonExcursion
Thursday 28.8.
09:00-10:00Nicolai Vorobjov: Effective quantifier elimination over real closed fieldsTutorial II
Session Logic Constructions
10:00-10:30Bernhard Reus: Modular Semantics and Logics of Classes
10:30-11:00Yu Zhang, David Nowak: Logical Relations for Dynamic Name Creation
11:00-12:00Coffee Break and Poster Session
Session Normalization
12:00-12:30Alexandre Miquel: A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
12:30-13:00René David, Bruno Guillaume: Strong Normalization of the Typed $\lws$-calculus
13:30-14:30Lunchbreak
Session Constraints
14:30-15:00Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates
15:00-15:30Ferdinand Börner, Andrei Bulatov, Peter Jeavons, Andrei Krokhin: Quantified Constraints: Algorithms and Complexity
15:30-16:00Coffee Break
Session Semantics
16:00-16:30James Laird: Bistability: an Extensional Characterization of Sequentiality
16:30-17:00Lutz Schröder: Henkin models of the partial $\lambda$-calculus
17:00-17:10Break
17:10-18:10Dov Gabbay: Title to be announcedInvited Lecture
Friday 29.8.
09:00-10:00Nicolai Vorobjov: Effective model completeness of the theory of restricted Pfaffian functionsInvited Lecture
Session Model Checking
10:00-10:30Detlef Kähler, Thomas Wilke: Program Complexity of Dynamic LTL Model Checking
10:30-11:00Coffee Break
Session Logic and Games I
11:00-11:30Lukasz Krzeszczakowski: Pebble games on trees
11:30-12:00Phokion G. Kolaitis, Jonathan Panttaja: On the Complexity of Existential Pebble Games
12:00-12:10Break
12:10-12:40Julian C. Bradfield: Parity of Imperfection
12:40-13:10Anuj Dawar, David Richerby: A Fixed-Point Logic with Symmetric Choice
13:10-15:00Lunch Break
Session Queries
15:00-15:30Thomas Eiter, Kazuhisa Makino: Generating all Abductive Explanations for Queries on Propositional Horn Theories
15:30-16:00Marko Samer, Helmut Veith: Validity of CTL Queries Revisited
16:00-16:30Coffee Break
16:30-17:00Martin Grohe, Nicole Schweikardt: Comparing the succinctness of monadic query languages over finite trees
Saturday 30.8.
09:00-09:15Opening of GAMES
09:15-11:25Ahmed Bouajjani: Verification of Infinite State SystemTutorial
11:25-11:55Coffee Break
Session Logic and Games II
11:55-12:25Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger: Simple Stochastic Parity Games
12:25-12:55Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso: Deciding Monotonic Games
12:55-13:00Break
13:00-13:30Jacques Duparc: Positive Games and Persistent Strategies
13:30-15:00Lunch Break
15:00-17:00Igor Walukiewicz: Winning strategies and synthesis of controllersTutorial
17:10-17:45Coffee Break
17:45-18:45Helmut Veith: Friends or Foes? Communities in Software VerificationInvited Lecture
18:45-19:00Closure of CSL/KGC

 List of invited talks

Computational Mathematics, Computational Logic, and Symbolic Computation
 Bruno Buchberger
Title to be announced
 Dov Gabbay
Fast Infinite-State Model Checking in Integer-Based Systems
 Tatiana Rybina, Andrei Voronkov
Friends or Foes? Communities in Software Verification
 Helmut Veith
Effective model completeness of the theory of restricted Pfaffian functions
 Nicolai Vorobjov

 Evening lecture in the Town Hall (Joint talk of CSL/KGC and ESSLLI)

A special evening lecture will be given in cooperation with the ESSLLI 2003 on Tuesday, 26. August, in the Vienna town hall at the reception. The exact time of this event will be announced soon.
Back to the Future: Explicit Logic for Computer Science
 Sergei Artemov

 List of tutorials

Verification of Infinite State System
 Ahmed Bouajjani
The Epsilon Calculus
 Georg Moser, Richard Zach
Effective quantifier elimination over real closed fields
 Nicolai Vorobjov
Winning strategies and synthesis of controllers
 Igor Walukiewicz

 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 Godel-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, and 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\"odel's Functionals
  Lars Kristiansen, Paul J. Voda
Towards a proof system for admissibility
  R. Iemhoff
Validity of CTL Queries Revisited
  Marko Samer, Helmut Veith

© 2002-2003 Kurt Gödel Society, Norbert Preining. 2004-10-12 Valid HTML 4.01! Valid CSS! Debian