Computer Science Logic: 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-2 by Luke OngComputer Science Logic: 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-2 by Luke Ong

Computer Science Logic: 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL…

byLuke Ong

Paperback | August 9, 2005

Pricing and Purchase Info

$159.25 online 
$191.95 list price save 17%
Earn 796 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


TheAnnualConferenceoftheEuropeanAssociationforComputerScienceLogic (EACSL), CSL 2005, was held at the University of Oxford on 22-25 August 2005. The conference series started as a programme of International Workshops onComputerScienceLogic,andtheninits6thmeetingbecametheAnnualC- ference of the EACSL. This conference was the 19th meeting and 14th EACSL conference; it was organized by the Computing Laboratory at the University of Oxford. The CSL 2005 Programme Committee considered 108 submissions from 25 countries during a two-week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 33 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Matthias Baaz, Ulrich Berger, Maarten Marx and Anatol Slissenko; the papers provided by the invited speakers appear at the front of this volume. Instituted in 2005, the Ackermann Award is the EACSL Outstanding D- sertation Award for Logic in Computer Science. The award winners for the - augural year, Mikola j Bojanczyk, ´ Konstantin Korovin and Nathan Segerlind, were invited to present their work at the conference. Citations for the awards, abstracts of the theses, and biographical sketches of the award winners are at the end of the proceedings.
Title:Computer Science Logic: 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL…Format:PaperbackDimensions:567 pages, 23.5 × 15.5 × 0.07 inPublished:August 9, 2005Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540282319

ISBN - 13:9783540282310


Table of Contents

Invited Lectures.- XML Navigation and Tarski's Relation Algebras.- Verification in Predicate Logic with Time: Algorithmic Questions.- Note on Formal Analogical Reasoning in the Juridical Context.- An Abstract Strong Normalization Theorem.- Semantics and Logics.- On Bunched Polymorphism.- Distributed Control Flow with Classical Modal Logic.- A Logic of Coequations.- A Semantic Formulation of ???-Lifting and Logical Predicates for Computational Metalanguage.- Type Theory and Lambda Calculus.- Order Structures on Böhm-Like Models.- Higher-Order Matching and Games.- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations.- On the Role of Type Decorations in the Calculus of Inductive Constructions.- Linear Logic and Ludics.- L-Nets, Strategies and Proof-Nets.- Permutative Logic.- Focusing the Inverse Method for Linear Logic.- Towards a Typed Geometry of Interaction.- Constraints.- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints.- Finite Models, Decidability and Complexity.- Coprimality in Finite Models.- Towards a Characterization of Order-Invariant Queries over Tame Structures.- Decidability of Term Algebras Extending Partial Algebras.- Results on the Guarded Fragment with Equivalence or Transitive Relations.- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic.- On the Complexity of Hybrid Logics with Binders.- The Complexity of Independence-Friendly Fixpoint Logic.- Closure Properties of Weak Systems of Bounded Arithmetic.- Verification and Model Checking.- Transfinite Extension of the Mu-Calculus.- Bounded Model Checking of Pointer Programs.- PDL with Intersection and Converse Is Decidable.- On Deciding Topological Classes of Deterministic Tree Languages.- Constructive Reasoning and Computational Mathematics.- Complexity and Intensionality in a Type-1 Framework for Computable Analysis.- Computing with Sequences, Weak Topologies and the Axiom of Choice.- Light Functional Interpretation.- Feasible Proofs of Matrix Properties with Csanky's Algorithm.- Implicit Computational Complexity and Rewriting.- A Propositional Proof System for Log Space.- Identifying Polynomial-Time Recursive Functions.- Confluence of Shallow Right-Linear Rewrite Systems.- Appendices.- The Ackermann Award 2005.- Clemens Lautemann: 1951-2005 An Obituary.