Skip to main content
  • Conference proceedings
  • © 1993

Logic Programming and Automated Reasoning

4th International Conference, LPAR'93, St.Petersburg, Russia, July 13-20, 1993. Proceedings

Editors:

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Buy it now

Buying options

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 (36 papers)

  1. Front Matter

  2. Entailment and disentailment of order-sorted feature constraints

    • Hassan Aït-Kaci, Andreas Podelski
    Pages 1-18
  3. Computing extensions of default logic — Preliminary report

    • Grigoris Antoniou, Elmar Langetepe, Volker Sperschneider
    Pages 19-27
  4. Prolog with arrays and bounded quantifications

    • Jonas Barklund, Johan Bevemyr
    Pages 28-39
  5. Consistency checking of automata functional specifications

    • Anatoli N. Chebotarev, Marina K. Morokhovets
    Pages 76-85
  6. Yet another application for Toupie: Verification of mutual exclusion algorithms

    • Marc-Michel Corsini, Alain Griffault, Antoine Rauzy
    Pages 86-97
  7. Parsing with DCG-terms

    • Andrew Davison
    Pages 98-109
  8. Ordered paramodulation and resolution as decision procedure

    • Christian Fermüller, Gernot Salzer
    Pages 122-133
  9. Static analysis of Prolog with cut

    • Gilberto Filé, Sabina Rossi
    Pages 134-145
  10. A new type theory for representing logics

    • Philippa Gardner
    Pages 146-157
  11. Verification of Switch-level designs with many-valued logic

    • Reiner Hähnle, Werner Kernig
    Pages 158-169
  12. Deciding in HFS-theory via linear integer programming

    • M. Hibti, H. Lombardi, B. Legeard
    Pages 170-181
  13. Increasing the versatility of heuristic based theorem provers

    • Alistair Manning, Andrew Ireland, Alan Bundy
    Pages 194-204

About this book

LPAR is an international conference series aimed at bringing together researchers interested in logic programming and automated reasoning. The research in logic programming grew out of the research in automated reasoning in the early 1970s. Later, the implementation techniques known from logic programming were used in implementing theorem proving systems. Results from both fields applied to deductive databases. This volume contains the proceedings of LPAR '93, which was organized by the Russian Association for Logic Programming. The volume contains 35 contributed papers selected from 84 submissions, together with an invited paper by Peter Wegner entitled "Reasoning versus modeling in computer science".

Bibliographic Information

Buy it now

Buying options

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