default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th CSL 2005: Oxford, UK
- C.-H. Luke Ong:
Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings. Lecture Notes in Computer Science 3634, Springer 2005, ISBN 3-540-28231-9
Invited Lectures
- Maarten Marx:
XML Navigation and Tarski's Relation Algebras. 1-2 - Anatol Slissenko:
Verification in Predicate Logic with Time: Algorithmic Questions. 3-17 - Matthias Baaz:
Note on Formal Analogical Reasoning in the Juridical Context. 18-26 - Ulrich Berger:
An Abstract Strong Normalization Theorem. 27-35
Semantics and Logics
- Matthew Collinson, David J. Pym, Edmund Robinson:
On Bunched Polymorphism. 36-50 - Tom Murphy VII, Karl Crary, Robert Harper:
Distributed Control Flow with Classical Modal Logic. 51-69 - Jirí Adámek:
A Logic of Coequations. 70-86 - Shin-ya Katsumata
:
A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage. 87-102
Type Theory and Lambda Calculus
- Paula Severi, Fer-Jan de Vries:
Order Structures on Böhm-Like Models. 103-118 - Colin Stirling:
Higher-Order Matching and Games. 119-134 - Frédéric Blanqui:
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations. 135-150 - Bruno Barras, Benjamin Grégoire:
On the Role of Type Decorations in the Calculus of Inductive Constructions. 151-166
Linear Logic and Ludics
- Pierre-Louis Curien, Claudia Faggian:
L-Nets, Strategies and Proof-Nets. 167-183 - Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet:
Permutative Logic. 184-199 - Kaustuv Chaudhuri, Frank Pfenning:
Focusing the Inverse Method for Linear Logic. 200-215 - Esfandiar Haghverdi, Philip J. Scott:
Towards a Typed Geometry of Interaction. 216-231
Constraints
- Hubie Chen, Víctor Dalmau:
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. 232-247 - Ashish Tiwari:
An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints. 248-262
Finite Models, Decidability and Complexity
- Marcin Mostowski, Konrad Zdanowski:
Coprimality in Finite Models. 263-275 - Michael Benedikt, Luc Segoufin:
Towards a Characterization of Order-Invariant Queries over Tame Structures. 276-291 - Bakhadyr Khoussainov, Sasha Rubin:
Decidability of Term Algebras Extending Partial Algebras. 292-308 - Emanuel Kieronski:
Results on the Guarded Fragment with Equivalence or Transitive Relations. 309-324 - Bruno Courcelle, Christian Delhommé:
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. 325-338 - Balder ten Cate, Massimo Franceschet:
On the Complexity of Hybrid Logics with Binders. 339-354 - Julian C. Bradfield, Stephan Kreutzer:
The Complexity of Independence-Friendly Fixpoint Logic. 355-368 - Antonina Kolokolova:
Closure Properties of Weak Systems of Bounded Arithmetic. 369-383
Verification and Model Checking
- Julian C. Bradfield, Jacques Duparc, Sandra Quickert:
Transfinite Extension of the Mu-Calculus. 384-396 - Witold Charatonik, Lilia Georgieva, Patrick Maier:
Bounded Model Checking of Pointer Programs. 397-412 - Carsten Lutz:
PDL with Intersection and Converse Is Decidable. 413-427 - Filip Murlak:
On Deciding Topological Classes of Deterministic Tree Languages. 428-441
Constructive Reasoning and Computational Mathematics
- Branimir Lambov:
Complexity and Intensionality in a Type-1 Framework for Computable Analysis. 442-461 - Vasco Brattka, Matthias Schröder:
Computing with Sequences, Weak Topologies and the Axiom of Choice. 462-476 - Mircea-Dan Hernest:
Light Functional Interpretation. 477-492 - Michael Soltys:
Feasible Proofs of Matrix Properties with Csanky's Algorithm. 493-508
Implicit Computational Complexity and Rewriting
- Steven Perron:
A Propositional Proof System for Log Space. 509-524 - Carsten Schürmann, Jatin Shah:
Identifying Polynomial-Time Recursive Functions. 525-540 - Guillem Godoy, Ashish Tiwari:
Confluence of Shallow Right-Linear Rewrite Systems. 541-556
Appendices
- Erich Grädel, Janos Makowsky, Alexander A. Razborov:
The Ackermann Award 2005. 557-565 - Johann A. Makowsky:
Clemens Lautemann: 1951-2005 An Obituary. 566-566
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-22 19:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
