Computer Science Logic: 17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003. Proceedings
Author: Matthias Baaz, Johann A. Makowsky
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-40801-7
DOI: 10.1007/b13224
Table of Contents:
- Deciding Monotonic Games
- The Commuting V-Diagram
- Concurrent Construction of Proof-Nets
- Back to the Future: Explicit Logic for Computer Science
- Constraint Satisfaction with Countable Homogeneous Templates
- Quantified Constraints: Algorithms and Complexity
- Verification of Infinite State Systems
- Parity of Imperfection or Fixing Independence
- Atomic Cut Elimination for Classical Logic
- Computational Mathematics, Computational Logic, and Symbolic Computation
- Simple Stochastic Parity Games
- Machine Characterizations of the Classes of the W-Hierarchy
- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
- On Relativisation and Complexity Gap for Resolution-Based Proof Systems
- Strong Normalization of the Typed λ
- A Fixed-Point Logic with Symmetric Choice
- Positive Games and Persistent Strategies
- Generating All Abductive Explanations for Queries on Propositional Horn Theories
- Refined Complexity Analysis of Cut Elimination
- Comparing the Succinctness of Monadic Query Languages over Finite Trees
Includes bibliographical references and index
