Skip to main content
  • Conference proceedings
  • © 1999

Computer Science Logic

12th International Workshop, CSL'98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings

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

Conference series link(s): CSL: International Workshop on Computer Science Logic

Conference proceedings info: CSL 1998.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

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

Table of contents (28 papers)

  1. Front Matter

  2. Invited Papers

    1. Trakhtenbrot Theorem and Fuzzy Logic

      • Petr Hájek
      Pages 1-8
    2. Testing of Finite State Systems

      • Mihalis Yannakakis, David Lee
      Pages 29-44
  3. Contributed Papers

    1. On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases

      • Fosca Giannotti, Giuseppe Manco, Mirco Nanni, Dino Pedreschi
      Pages 58-72
    2. Revision Programming = Logic Programming + Integrity Constraints

      • Victor Marek, Inna Pivkina, Mirosław Truszczyński
      Pages 73-89
    3. Choice Construct and Lindström Logics

      • H. K. Hoang
      Pages 105-125
    4. Monadic NP and Graph Minors

      • Martin Kreidler, Detlef Seese
      Pages 126-141
    5. Invariant Definability and P/poly

      • J. A. Makowsky
      Pages 142-158
    6. An Upper Bound for Minimal Resolution Refutations

      • Hans Kleine Büning
      Pages 171-178
    7. On an Optimal Deterministic Algorithm for SAT

      • Zenon Sadowski
      Pages 179-187
    8. Characteristic Properties of Majorant-Computability Over the Reals

      • M. V. Korovina, O. V. Kudinov
      Pages 188-203
    9. Theorems of Péter and Parsons in Computer Programming

      • Ján Komara, Paul J. Voda
      Pages 204-223
    10. Kripke, Belnap, Urquhart and Relevant Decidability & Complexity

      • Jacques Riche, Robert K. Meyer
      Pages 224-240
    11. Normalization of Typable Terms by Superdevelopments

      • Zurab Khasidashvili, Adolfo Piperno
      Pages 260-282
    12. Subtyping Functional+Nonempty Record Types

      • Sergei Vorobyov
      Pages 283-297

Other Volumes

  1. Computer Science Logic

Editors and Affiliations

  • Computing Laboratory, Oxford University, United Kingdom

    Georg Gottlob

  • GREYC, Université de Caen, CNRS, Caen cedex, France

    Etienne Grandjean

  •  ,  

    Katrin Seyr

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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