Skip to main content
SpringerLink
Log in

CSL'88

2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. Egon Börger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hans Kleine Büning
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Michael M. Richter
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields.

Keywords

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. On disjunctive self-reducibility

    • Klaus Ambos-Spies, Jürgen Kämper
    Pages 1-13

  3. The knowledge representation language LLILOG

    • Christoph Beierle, Jochen Dörre, Udo Pletat, Claus Rollinger, Peter H. Schmitt, Rudi Studer
    Pages 14-51

  4. Completeness with respect to interpretations in deterministic and nondeterministic polynomial time

    • Elias Dahlhaus
    Pages 52-62

  5. A temporal logic approach to specify and to prove properties of finite state concurrent systems

    • M. Danelutto, A. Masini
    Pages 63-79

  6. A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods

    • Elmar Eder
    Pages 80-98

  7. Characterizing complexity classes by general recursive definitions in higher types

    • Andreas Goerdt
    Pages 99-117

  8. Size of models versus length of computations

    • Erich Grädel
    Pages 118-137

  9. Boolean circuit complexity of algebraic interpolation problems

    • Marek Karpinski
    Pages 138-147

  10. Loop detection in propositional Prolog programs

    • Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
    Pages 148-165

  11. Numberings of R1∪F

    • Martin Kummer
    Pages 166-186

  12. Interval temporal logic and star-free expressions

    • D. Lippert
    Pages 187-198

  13. An interpreter with lazy evaluation for Prolog with functions

    • Stefan Lüttringhaus
    Pages 199-225

  14. On the complexity of the decision problem in propositional nonmonotonic logic

    • Ilkka Niemelä
    Pages 226-239

  15. Gentzen-Systems for propositional temporal logics

    • Barbara Paech
    Pages 240-253

  16. Predicate inequalities as a basis for automated termination proofs for Prolog programs

    • Lutz Plümer
    Pages 254-271

  17. On the existence of fair schedulers

    • Lutz Priese
    Pages 272-287

  18. Using finite-linear temporal logic for specifying database dynamics

    • Gunter Saake, Udo W. Lipeck
    Pages 288-300

  19. Is average superlinear speedup possible?

    • Ewald Speckenmeyer
    Pages 301-312

  20. Enforcement of integrity constraints in a semantic data model

    • Norbert Südkamp, Peter Kandzia
    Pages 313-328
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation