Table of contents

  1. Front Matter
  2. Christoph Beierle, Egon Börger
    Pages 15-34
  3. Eike Best, Javier Esparza
    Pages 35-52
  4. Jawahar Chirimar, James Lipton
    Pages 53-67
  5. Jörg Flum
    Pages 111-118
  6. Juan Carlos, González Moreno, Maria Teresa Hortalá González, Mario Rodríguez Artalejo
    Pages 134-148
  7. Erich Grädel
    Pages 149-163
  8. J. N. Hooker
    Pages 184-200
  9. Brigitte Hösli
    Pages 201-212
  10. M. R. K. Krishna Rao, D. Kapur, R. K. Shyamasundar
    Pages 213-226
  11. Daniel Lehmann
    Pages 227-241
  12. Haas Leiß
    Pages 242-256

About these proceedings


This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others.


Resolution complexity computer computer science logic petri net semantics term rewriting

Bibliographic information

Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking