LEADER 05117oam 2200565 450 001 9910143649003321 005 20210714225920.0 010 $a3-540-48168-0 024 7 $a10.1007/3-540-48168-0 035 $a(CKB)1000000000211133 035 $a(SSID)ssj0000322131 035 $a(PQKBManifestationID)11277392 035 $a(PQKBTitleCode)TC0000322131 035 $a(PQKBWorkID)10299212 035 $a(PQKB)10009848 035 $a(DE-He213)978-3-540-48168-3 035 $a(MiAaPQ)EBC3072346 035 $a(MiAaPQ)EBC6486248 035 $a(PPN)155192205 035 $a(EXLCZ)991000000000211133 100 $a20210714d1999 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aComputer science logic $e13th international workshop, CSL'99 : 8th annual conference of the EACSL, Madrid, Spain, September 20-25, 1999 : proceedings /$fedited by Jörg Flum; M. Rodríguez Artalejo 205 $a1st ed. 1999. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (XII, 588 p.) 225 1 $aLecture notes in computer science ;$vVolume 1683 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-66536-6 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Papers -- Topological Queries in Spatial Databases -- The Consistency Dimension, Compactness, and Query Learning -- Descriptive and Parameterized Complexity -- Logical Specification of Operational Semantics -- Constraint-Based Analysis of Broadcast Protocols -- Contributed Papers -- Descriptive Complexity Theory for Constraint Databases -- Applicative Control and Computational Complexity -- Applying Rewriting Techniques to the Verification of Erlang Processes -- Difference Decision Diagrams -- Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States -- Verifying Liveness by Augmented Abstraction -- Signed Interval Logic -- Quantitative Temporal Logic -- An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces -- Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting -- Closed Reductions in the ?-Calculus -- Kripke Resource Models of a Dependently-Typed, Bunched ?-Calculus (Extended Abstract) -- A Linear Logical View of Linear Type Isomorphisms -- Choice Logic Programs and Nash Equilibria in Strategic Games -- Resolution Method for Modal Logic with Well-Founded Frames -- A NExpTime-Complete Description Logic Strictly Contained in C 2 -- A Road-Map on Complexity for Hybrid Logics -- MonadicNLIN and Quantifier-Free Reductions -- Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Frass Games -- Fixpoint Alternation and the Game Quantifier -- Lower Bounds for Space in Resolution -- Program Schemes, Arrays, Lindstrm Quantifiers and Zero-One Laws -- Open Least Element Principle and Bounded Query Computation -- A Universal Innocent Game Model for the Bhm Tree Lambda Theory -- Anti-Symmetry of Higher-Order Subtyping -- Safe Proof Checking in Type Theory with Y -- Monadic Presentations of Lambda Terms Using Generalized Inductive Types -- A P-Time Completeness Proof for Light Logics -- On Guarding Nested Fixpoints -- A Logical Viewpoint on Process-Algebraic Quotients -- A Truly Concurrent Semantics for a Simple Parallel Programming Language -- Specification Refinement with System F -- Pre-logical Relations -- Data-Refinement for Call-By-Value Programming Languages -- Tutorials -- Tutorial on Term Rewriting -- Tutorial on Interactive Theorem Proving Using Type Theory. 330 $aThe 1999 Annual Conference of the European Association for Computer Science Logic, CSL?99, was held in Madrid, Spain, on September 20-25, 1999. CSL?99 was the 13th in a series of annual meetings, originally intended as Internat- nal Workshops on Computer Science Logic, and the 8th to be held as the - nual Conference of the EACSL. The conference was organized by the Computer Science Departments (DSIP and DACYA) at Universidad Complutense in M- rid (UCM). The CSL?99 program committee selected 34 of 91 submitted papers for p- sentation at the conference and publication in this proceedings volume. Each submitted paper was refereed by at least two, and in almost all cases, three di erent referees. The second refereeing round, previously required before a - per was accepted for publication in the proceedings, was dropped following a decision taken by the EACSL membership meeting held during CSL?98 (Brno, Czech Republic, August 25, 1998). 410 0$aLecture notes in computer science ;$vVolume 1683. 606 $aComputer logic$vCongresses 615 0$aComputer logic 676 $a004.015113 702 $aFlum$b Jörg 702 $aRodríguez Artalejo$b M. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910143649003321 996 $aComputer Science Logic$9771972 997 $aUNINA