Computer Science Logic

13th International Workshop, CSL’99 8th Annual Conference of the EACSL Madrid, Spain, September 20–25, 1999 Proceedings

  • Jörg Flum
  • Mario Rodriguez-Artalejo
Conference proceedings CSL 1999

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1683)

Table of contents

  1. Front Matter
    Pages I-XI
  2. Invited Papers

    1. Martin Grohe
      Pages 14-31
    2. Giorgio Delzanno, Andreas Podelski, Javier Esparza
      Pages 50-66
  3. Contributed Papers

    1. Descriptive Complexity, I

      1. Erich Grädel, Stephan Kreutzer
        Pages 67-81
    2. Verification

      1. Jesper Møller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard
        Pages 111-125
      2. Yonit Kesten, Amir Pnueli
        Pages 141-156
    3. Temporal Logic

      1. Thomas Marthedal Rasmussen
        Pages 157-171
      2. Yoram Hirshfeld, Alexander Rabinovich
        Pages 172-187
    4. Lambda Calculus, Linear Logic

    5. Logic Programming, Modal Logic, Description Logic

      1. Marina De Vos, Dirk Vermeir
        Pages 266-276
      2. Shigeki Hagihara, Naoki Yonezaki
        Pages 277-291
      3. Carlos Areces, Patrick Blackburn, Maarten Marx
        Pages 307-321
    6. Descriptive Complexity, II

      1. Clemens Lautemann, Bernhard Weinzinger
        Pages 322-337
      2. J. C. Bradfield
        Pages 350-361
    7. Logic and Complexity

    8. Lambda Calculus, Type Theory

      1. Andrew D. Ker, Hanno Nickau, C. -H. Luke Ong
        Pages 405-419
      2. Adriana Compagnoni, Healfdene Goguen
        Pages 420-438
      3. Herman Geuvers, Erik Poll, Jan Zwanenburg
        Pages 439-452
      4. Thorsten Altenkirch, Bernhard Reus
        Pages 453-468
    9. Linear Logic, Mu Calculus, Concurrency

      1. Helmut Seidl, Andreas Neumann
        Pages 484-498
      2. Antonín Kučera, Javier Esparza
        Pages 499-514
    10. Specification, Data Refinement

      1. Jo Erskine Hannay
        Pages 530-545
      2. Furio Honsell, Donald Sannella
        Pages 546-561
      3. Yoshiki Kinoshita, John Power
        Pages 562-576
  4. Tutorials

  5. Back Matter
    Pages 579-580

About these proceedings


The 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).


AI Logic Computer Science Logic Division Erlang Formal Logic Mathematical Logic Programming Theory Resolution complexity complexity theory databases interactive theorem proving lambda calculus programming language theorem proving

Editors and affiliations

  • Jörg Flum
    • 1
  • Mario Rodriguez-Artalejo
    • 2
  1. 1.Mathematisches InstitutUniversität FreiburgEckerstr. 1Germany
  2. 2.Dpto. de Sistemas Informáticos y Programación Edificio Fac. MatemáticasUniversidad Complutense de MadridMadridSpain

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66536-6
  • Online ISBN 978-3-540-48168-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking