Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th CSL 1999: Madrid, Spain
- Jörg Flum, Mario Rodríguez-Artalejo:
Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings. Lecture Notes in Computer Science 1683, Springer 1999, ISBN 3-540-66536-6
Invited Papers
- Victor Vianu:
Topological Queries in Spatial Databases. 1 - José L. Balcázar:
The Consistency Dimension, Compactness, and Query Learning. 2-13 - Martin Grohe:
Descriptive and Parameterized Complexity. 14-31 - Peter D. Mosses
:
Logical Specification of Operational Semantics. 32-49 - Giorgio Delzanno, Javier Esparza, Andreas Podelski:
Constraint-Based Analysis of Broadcast Protocols. 50-66
Descriptive Complexity, I
- Erich Grädel, Stephan Kreutzer:
Descriptive Complexity Theory for Constraint Databases. 67-81 - Daniel Leivant:
Applicative Control and Computational Complexity. 82-95
Verification
- Thomas Arts, Jürgen Giesl:
Applying Rewriting Techniques to the Verification of Erlang Processes. 96-110 - Jesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard:
Difference Decision Diagrams. 111-125 - Martin Fränzle:
Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States. 126-140 - Yonit Kesten, Amir Pnueli:
Verifying Liveness by Augmented Abstraction. 141-156
Temporal Logic
- Thomas Marthedal Rasmussen:
Signed Interval Logic. 157-171 - Yoram Hirshfeld, Alexander Moshe Rabinovich:
Quantitative Temporal Logic. 172-187 - Volker Diekert, Paul Gastin:
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. 188-203
Lambda Calculus, Linear Logic
- Eduardo Bonelli:
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. 204-219 - Maribel Fernández, Ian Mackie:
Closed Reductions in the lambda-Calculus. 220-234 - Samin S. Ishtiaq, David J. Pym:
Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus. 235-249 - Vincent Balat, Roberto Di Cosmo:
A Linear Logical View of Linear Type Isomorphisms. 250-265
Logic Programming, Modal Logic, Description Logic
- Marina De Vos, Dirk Vermeir:
Choice Logic Programs and Nash Equilibria in Strategic Games. 266-276 - Shigeki Hagihara, Naoki Yonezaki:
Resolution Method for Modal Logic with Well-Founded Frames. 277-291 - Stephan Tobies:
A NExpTime-Complete Description Logic Strictly Contained in C2. 292-306 - Carlos Areces, Patrick Blackburn, Maarten Marx:
A Road-Map on Complexity for Hybrid Logics. 307-321
Descriptive Complexity, II
- Clemens Lautemann, Bernhard Weinzinger:
MonadicNLIN and Quantifier-Free Reductions. 322-337 - Jerzy Marcinkowski:
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. 338-349 - Julian C. Bradfield:
Fixpoint Alternation and the Game Quantifier. 350-361
Logic and Complexity
- Jacobo Torán:
Lower Bounds for Space in Resolution. 362-373 - Iain A. Stewart:
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. 374-388 - Lev D. Beklemishev:
Open Least Element Principle and Bounded Query Computation. 389-404
Lambda Calculus, Type Theory
- Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong:
A Universal Innocent Game Model for the Böhm Tree Lambda Theory. 405-419 - Adriana B. Compagnoni, Healfdene Goguen:
Anti-Symmetry of Higher-Order Subtyping. 420-438 - Herman Geuvers, Erik Poll, Jan Zwanenburg:
Safe Proof Checking in Type Theory with Y. 439-452 - Thorsten Altenkirch, Bernhard Reus:
Monadic Presentations of Lambda Terms Using Generalized Inductive Types. 453-468
Linear Logic, Mu Calculus, Concurrency
- Luca Roversi:
A P-Time Completeness Proof for Light Logics. 469-483 - Helmut Seidl, Andreas Neumann:
On Guarding Nested Fixpoints. 484-498 - Antonín Kucera, Javier Esparza:
A Logical Viewpoint on Process-Algebraic Quotients. 499-514 - Paul Gastin, Michael W. Mislove:
A Truly Concurrent Semantics for a Simple Parallel Programming Language. 515-529
Specification, Data Refinement
- Jo Erskine Hannay:
Specification Refinement with System F. 530-545 - Furio Honsell, Donald Sannella:
Pre-logical Relations. 546-561 - Yoshiki Kinoshita, John Power:
Data-Refinement for Call-By-Value Programming Languages. 562-576
Tutorials
- Aart Middeldorp:
Term Rewriting. 577 - Douglas J. Howe:
Interactive Theorem Proving Using Type Theory. 578
a service of 
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-04-26 17:29 CEST 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:
