List of Papers Accepted for LICS04
==================================

Sasha Rubin, Bakhadyr Khoussainov, Andre Nies and Frank Stephan.
   Automatic Structures: Richness and Limitation
 
Antonio Bucciarelli and Antonino Salibra.
   The Sensible Graph Theories of Lambda Calculus

Mohammad Reza Mousavi, Michel A. Reniers and Jan Friso Groote. 
   Congruence for SOS with Data

Gustav Nordh and Peter Jonsson.
   An Algebraic Approach to the Complexity of Propositional Circumscription

Martin Grohe and Nicole Schweikardt. 
   The Succinctness of First-Order Logic on Linear Orders

Dennis Dams and Kedar Namjoshi.
   The Existence of Finite Abstractions for Branching Time Model Checking

Joel Ouaknine and James Worrell. 
   On the Language Inclusion Problem for Timed Automata: Closing a 
   Decidability Gap
 
Carsten Fuhrmann and David J. Pym.
   On the Geometry of Interaction for Classical Logic
 
Stephen Cook and Phuong Nguyen. 
   VTC0: A Second-Order Theory for TC0
 
Michael Huth.
   Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space
 
Patrick Baillot and Kazushige Terui.
   Light Types for Polynomial Time Computation in Lambda Calculus

Benedetto Intrigila and Rick Statman. 
   The Omega Rule is $\Pi^{0}_{2} $ -Hard in the $\lambda\beta $- Calculus
 
Luca de Alfaro, Patrice Godefroid and Radha Jagadeesan. 
   Three-Valued Abstractions of Games:Uncertainty, but with Precision
 
Yohji Akama, Stefano Berardi, Susumu Hayashi and Ulrich Kohlenbach. 
   An Arithmetical Hierarchy of the Laws of Excluded Middle and 
   Related Principles
 
Joerg Flum and Martin Grohe. 
   Model-Checking Problems as a Basis for Parameterized Intractability

Stephen Cook and Neil Thapen.
   The Strength of Replacement in Weak Arithmetic

Stephen Cook and Antonina Kolokolova.
   A Second-Order Theory for NL

Tom Murphy VII, Karl Crary, Robert Harper and Frank Pfenning. 
   A Symmetric Modal Lambda Calculus for Distributed Computing

Ulrich Berger. 
   A Computational Interpretation of Open Induction

Felix Klaedtke. 
   On the Automata Size for Presburger Arithmetic

Michael Baldamus, Joachim Parrow and Bjoern Victor. 
   Spi Calculus Translated to pi-Calculus Preserving May-Testing

Victor Dalmau, Andrei Krokhin and Benoit Larose. 
   First-order Definable Retraction Problems for Posets and Reflexive Graphs
 
Javier Esparza, Antonin Kucera and Richard Mayr.
   Model-Checking Probabilistic Pushdown Automata

Andreas Podelski and Andrey Rybalchenko.
   Transition Invariants
 
Stefan Woehrle and Wolfgang Thomas.
  Model Checking Synchronized Products of Infinite Transition Systems

Kerkko Luosto. 
   Equicardinality on Linear Orders

Jose Raymundo Marcial-Romero and Martin Hotzel Escardo.
   Semantics of a Sequential Language for Exact Real Number Computation
 
Andrei Bulatov. 
   A Graph of a Relational Structure and Constraint Satisfaction Problems

Louis Latour. 
   From Automata to Formulas: Convex Integer Polyhedra

Parosh Aziz Abdulla, Johann Deneux and Pritha Mahata.
   Multi-Clock Timed Networks

Philippe de Groote, Bruno Guillaume and Sylvain Salvati.
   Vector Addition Tree Automata

Kazushige Terui.
   Proof Nets and Boolean Circuits

Samson Abramsky and Bob Coecke.
   A Categorical Semantics of Quantum Protocols

David A Naumann and Mike Barnett.
   Towards Imperative Modules: Reasoning about Invariants and Sharing 
   of Mutable State 

James Cheney and Murdoch Gabbay. 
   A Sequent Calculus for Nominal Logic

Samson Abramsky, Dan Ghica, Andrzej Murawski, Luke Ong and Ian Stark.
   Nominal Games and Full Abstraction for the Nu-Calculus

Brian P. Dunphy and Uday S. Reddy.
   Parametric Limits

Sanjit Seshia and Randal Bryant. 
  Deciding Quantifier-Free Presburger Formulas using Finite Instantiation 
  based on Parameterized Solution Bounds

Daniel Leivant. 
   Proving Termination Assertions in Dynamic Logics

Krishnendu Chatterjee, Thomas A. Henzinger and Marcin Jurdzinski.
   Games with Secure Equilibria