Computer Science Logic 计算机科学逻辑/会议录

2005-9  

北京燕山出版社  

Ong, L.; Ong, Luke;  

567  

This book constitutes the refereed proceedings of the 19th International Workshop on Computer Science Logic, CSL 2005, held as the 14th Annual Conference of the EACSL in Oxford, UK in August 2005. The 33 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from 108 papers submitted. All current aspects of logic in computer science are addressed ranging from mathematical logic and logical foundations to methodological issues and applications of logics in various computing contexts. The volume is organized in topical sections on semantics and logics, type theory and lambda calculus, linear logic and ludics, constraints, finite models, decidability and complexity, verification and model checking, constructive reasoning and computational mathematics, and implicit computational complexity and rewriting.

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 TheoremSemantics and Logics　On Bunched Polymorphism　Distributed Control Flow with Classical Modal Logic　A Logic of Coequations　A Semantic Formulation of TT-Lifting and Logical Predicates for Computational MetalanguageType Theory and Lambda Calculus　Order Structures on BShm-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 ConstructionsLinear Logic and Ludics　L-Nets, Strategies and Proof-Nets　Permutative Logic　Focusing the Inverse Method for Linear Logic　Towards a Typed Geometry of InteractionConstraints　From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction　An Algebraic Approach for the Unsatisfiability of Nonlinear ConstraintsFinite Models, Decidability and Complexity　Coprimality in Finite Models　Towards a Characterization of Order-lnvariant 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 ArithmeticVerification and Model CheckingConstructive Reasoning and Computational MathematicesImplicit Computational Complexity and RewritingAppendicesAuthor Index

Computer Science Logic 计算机科学逻辑/会议录 PDF格式下载