## C.-H. Luke Ong

*Proceedings of the 14th EACSL Annual Conference / 19th International Workshop on Computer Science Logic*

CSL, 2005.

@proceedings{CSL-2005, address = "Oxford, England, United Kingdom", editor = "C.-H. Luke Ong", isbn = "3-540-28231-9", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the 14th EACSL Annual Conference / 19th International Workshop on Computer Science Logic}", volume = 3634, year = 2005, }

### Contents (37 items)

- CSL-2005-Marx #algebra #navigation #xml
- XML Navigation and Tarski’s Relation Algebras (MM), pp. 1–2.
- CSL-2005-Slissenko #algorithm #logic #verification
- Verification in Predicate Logic with Time: Algorithmic Questions (AS), pp. 3–17.
- CSL-2005-Baaz #reasoning
- Note on Formal Analogical Reasoning in the Juridical Context (MB), pp. 18–26.
- CSL-2005-Berger #normalisation #theorem
- An Abstract Strong Normalization Theorem (UB), pp. 27–35.
- CSL-2005-CollinsonPR #morphism #on the #polymorphism
- On Bunched Polymorphism (MC, DJP, ER), pp. 36–50.
- CSL-2005-VIICH #control flow #distributed #logic
- Distributed Control Flow with Classical Modal Logic (TMV, KC, RH), pp. 51–69.
- CSL-2005-Adamek #equation #logic
- A Logic of Coequations (JA), pp. 70–86.
- CSL-2005-Katsumata #logic #metalanguage #semantics
- A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage (SyK), pp. 87–102.
- CSL-2005-SeveriV #modelling #order
- Order Structures on Böhm-Like Models (PS, FJdV), pp. 103–118.
- CSL-2005-Stirling #game studies #higher-order
- Higher-Order Matching and Games (CS), pp. 119–134.
- CSL-2005-Blanqui #algebra #calculus #decidability
- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations (FB), pp. 135–150.
- CSL-2005-BarrasG #calculus #induction #on the
- On the Role of Type Decorations in the Calculus of Inductive Constructions (BB, BG), pp. 151–166.
- CSL-2005-CurienF
- L-Nets, Strategies and Proof-Nets (PLC, CF), pp. 167–183.
- CSL-2005-AndreoliPR #logic
- Permutative Logic (JMA, GP, PR), pp. 184–199.
- CSL-2005-ChaudhuriP #linear #logic
- Focusing the Inverse Method for Linear Logic (KC, FP), pp. 200–215.
- CSL-2005-HaghverdiS #geometry #interactive #towards
- Towards a Typed Geometry of Interaction (EH, PJS), pp. 216–231.
- CSL-2005-ChenD #algorithm #consistency #constraints #game studies #quantifier
- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction (HC, VD), pp. 232–247.
- CSL-2005-Tiwari #algebra #approach #constraints #satisfiability
- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints (AT), pp. 248–262.
- CSL-2005-MostowskiZ #finite #modelling
- Coprimality in Finite Models (MM, KZ), pp. 263–275.
- CSL-2005-BenediktS #invariant #query #towards
- Towards a Characterization of Order-Invariant Queries over Tame Structures (MB, LS), pp. 276–291.
- CSL-2005-KhoussainovR #algebra #decidability
- Decidability of Term Algebras Extending Partial Algebras (BK, SR), pp. 292–308.
- CSL-2005-Kieronski #equivalence #transitive
- Results on the Guarded Fragment with Equivalence or Transitive Relations (EK), pp. 309–324.
- CSL-2005-CourcelleD #composition #graph #higher-order #logic #monad
- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic (BC, CD), pp. 325–338.
- CSL-2005-CateF #complexity #hybrid #logic #on the
- On the Complexity of Hybrid Logics with Binders (BtC, MF), pp. 339–354.
- CSL-2005-BradfieldK #complexity #fixpoint #logic
- The Complexity of Independence-Friendly Fixpoint Logic (JCB, SK), pp. 355–368.
- CSL-2005-Kolokolova #bound
- Closure Properties of Weak Systems of Bounded Arithmetic (AK), pp. 369–383.
- CSL-2005-BradfieldDQ #calculus #μ-calculus
- Transfinite Extension of the μ-Calculus (JCB, JD, SQ), pp. 384–396.
- CSL-2005-CharatonikGM #bound #model checking #pointer #source code
- Bounded Model Checking of Pointer Programs (WC, LG, PM), pp. 397–412.
- CSL-2005-Lutz #decidability
- PDL with Intersection and Converse Is Decidable (CL), pp. 413–427.
- CSL-2005-Murlak #on the
- On Deciding Topological Classes of Deterministic Tree Languages (FM), pp. 428–441.
- CSL-2005-Lambov #analysis #complexity #framework
- Complexity and Intensionality in a Type-1 Framework for Computable Analysis (BL), pp. 442–461.
- CSL-2005-BrattkaS #axiom #sequence
- Computing with Sequences, Weak Topologies and the Axiom of Choice (VB, MS), pp. 462–476.
- CSL-2005-Hernest #functional
- Light Functional Interpretation (MDH), pp. 477–492.
- CSL-2005-Soltys #algorithm #matrix #proving
- Feasible Proofs of Matrix Properties with Csanky’s Algorithm (MS), pp. 493–508.
- CSL-2005-Perron #proving
- A Propositional Proof System for Log Space (SP), pp. 509–524.
- CSL-2005-SchurmannS #identification #polynomial #recursion
- Identifying Polynomial-Time Recursive Functions (CS, JS), pp. 525–540.
- CSL-2005-GodoyT #confluence #linear #term rewriting
- Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.

9 ×#logic

4 ×#algebra

4 ×#on the

3 ×#algorithm

3 ×#calculus

3 ×#complexity

3 ×#decidability

2 ×#bound

2 ×#constraints

2 ×#game studies

4 ×#algebra

4 ×#on the

3 ×#algorithm

3 ×#calculus

3 ×#complexity

3 ×#decidability

2 ×#bound

2 ×#constraints

2 ×#game studies