Computer Science Logic (CSL '99)

Invited Papers.- Topological Queries in Spatial Databases.- The Consistency Dimension, Compactness, and Query Learning.- Descriptive and Parameterized Complexity.- Logical Specification of Operational Semantics.- Constraint-Based Analysis of Broadcast Protocols.- Contributed Papers.- Descriptive Complexity Theory for Constraint Databases.- Applicative Control and Computational Complexity.- Applying Rewriting Techniques to the Verification of Erlang Processes.- Difference Decision Diagrams.- Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States.- Verifying Liveness by Augmented Abstraction.- Signed Interval Logic.- Quantitative Temporal Logic.- An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.- Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting.- Closed Reductions in the ?-Calculus.- Kripke Resource Models of a Dependently-Typed, Bunched ?-Calculus (Extended Abstract).- A Linear Logical View of Linear Type Isomorphisms.- Choice Logic Programs and Nash Equilibria in Strategic Games.- Resolution Method for Modal Logic with Well-Founded Frames.- A NExpTime-Complete Description Logic Strictly Contained in C 2.- A Road-Map on Complexity for Hybrid Logics.- MonadicNLIN and Quantifier-Free Reductions.- Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games.- Fixpoint Alternation and the Game Quantifier.- Lower Bounds for Space in Resolution.- Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws.- Open Least Element Principle and Bounded Query Computation.- A Universal Innocent Game Model for the Böhm Tree Lambda Theory.- Anti-Symmetry of Higher-Order Subtyping.- Safe Proof Checking in Type Theory with Y.- Monadic Presentations of Lambda Terms Using Generalized Inductive Types.- A P-Time Completeness Proof for Light Logics.- On Guarding Nested Fixpoints.- A Logical Viewpoint on Process-Algebraic Quotients.- A Truly Concurrent Semantics