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