Abstract is missing.
- Topological Queries in Spatial DatabasesVictor Vianu. 1
- The Consistency Dimension, Compactness, and Query LearningJosé L. Balcázar. 2-13
- Descriptive and Parameterized ComplexityMartin Grohe. 14-31
- Logical Specification of Operational SemanticsPeter D. Mosses. 32-49
- Constraint-Based Analysis of Broadcast ProtocolsGiorgio Delzanno, Javier Esparza, Andreas Podelski. 50-66
- Descriptive Complexity Theory for Constraint DatabasesErich Grädel, Stephan Kreutzer. 67-81
- Applicative Control and Computational ComplexityDaniel Leivant. 82-95
- Applying Rewriting Techniques to the Verification of Erlang ProcessesThomas Arts, Jürgen Giesl. 96-110
- Difference Decision DiagramsJesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard. 111-125
- Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of StatesMartin Fränzle. 126-140
- Verifying Liveness by Augmented AbstractionYonit Kesten, Amir Pnueli. 141-156
- Signed Interval LogicThomas Marthedal Rasmussen. 157-171
- Quantitative Temporal LogicYoram Hirshfeld, Alexander Moshe Rabinovich. 172-187
- An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz TracesVolker Diekert, Paul Gastin. 188-203
- Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn SettingEduardo Bonelli. 204-219
- Closed Reductions in the lambda-CalculusMaribel Fernández, Ian Mackie. 220-234
- Kripke Resource Models of a Dependently-Typed, Bunched lambda-CalculusSamin S. Ishtiaq, David J. Pym. 235-249
- A Linear Logical View of Linear Type IsomorphismsVincent Balat, Roberto Di Cosmo. 250-265
- Choice Logic Programs and Nash Equilibria in Strategic GamesMarina De Vos, Dirk Vermeir. 266-276
- Resolution Method for Modal Logic with Well-Founded FramesShigeki Hagihara, Naoki Yonezaki. 277-291
- A NExpTime-Complete Description Logic Strictly Contained in C:::2:::Stephan Tobies. 292-306
- A Road-Map on Complexity for Hybrid LogicsCarlos Areces, Patrick Blackburn, Maarten Marx. 307-321
- MonadicNLIN and Quantifier-Free ReductionsClemens Lautemann, Bernhard Weinzinger. 322-337
- Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé GamesJerzy Marcinkowski. 338-349
- Fixpoint Alternation and the Game QuantifierJulian C. Bradfield. 350-361
- Lower Bounds for Space in ResolutionJacobo Torán. 362-373
- Program Schemes, Arrays, Lindström Quantifiers and Zero-One LawsIain A. Stewart. 374-388
- Open Least Element Principle and Bounded Query ComputationLev D. Beklemishev. 389-404
- A Universal Innocent Game Model for the Böhm Tree Lambda TheoryAndrew D. Ker, Hanno Nickau, C.-H. Luke Ong. 405-419
- Anti-Symmetry of Higher-Order SubtypingAdriana B. Compagnoni, Healfdene Goguen. 420-438
- Safe Proof Checking in Type Theory with YHerman Geuvers, Erik Poll, Jan Zwanenburg. 439-452
- Monadic Presentations of Lambda Terms Using Generalized Inductive TypesThorsten Altenkirch, Bernhard Reus. 453-468
- A P-Time Completeness Proof for Light LogicsLuca Roversi. 469-483
- On Guarding Nested FixpointsHelmut Seidl, Andreas Neumann. 484-498
- A Logical Viewpoint on Process-Algebraic QuotientsAntonín Kucera, Javier Esparza. 499-514
- A Truly Concurrent Semantics for a Simple Parallel Programming LanguagePaul Gastin, Michael W. Mislove. 515-529
- Specification Refinement with System FJo Erskine Hannay. 530-545
- Pre-logical RelationsFurio Honsell, Donald Sannella. 546-561
- Data-Refinement for Call-By-Value Programming LanguagesYoshiki Kinoshita, John Power. 562-576
- Term RewritingAart Middeldorp. 577
- Interactive Theorem Proving Using Type TheoryDouglas J. Howe. 578