Skip to main content
SpringerLink
Log in
Book cover

Logic Programming and Automated Reasoning

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

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Andrei Voronkov
    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 698)

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

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

Table of contents (36 papers)

  1. Front Matter

    Download chapter PDF

  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. Linear 0–1 inequalities and extended clauses

    • Peter Barth
    Pages 40-51

  6. Search space pruning by checking dynamic term growth

    • Stefan Brüning
    Pages 52-63

  7. A proof search system for a modal substructural logic based on labelled deductive systems

    • Hiu Fai Chau
    Pages 64-75

  8. Consistency checking of automata functional specifications

    • Anatoli N. Chebotarev, Marina K. Morokhovets
    Pages 76-85

  9. Yet another application for Toupie: Verification of mutual exclusion algorithms

    • Marc-Michel Corsini, Alain Griffault, Antoine Rauzy
    Pages 86-97

  10. Parsing with DCG-terms

    • Andrew Davison
    Pages 98-109

  11. A first order resolution calculus with symmetries

    • Uwe Egly
    Pages 110-121

  12. Ordered paramodulation and resolution as decision procedure

    • Christian Fermüller, Gernot Salzer
    Pages 122-133

  13. Static analysis of Prolog with cut

    • Gilberto Filé, Sabina Rossi
    Pages 134-145

  14. A new type theory for representing logics

    • Philippa Gardner
    Pages 146-157

  15. Verification of Switch-level designs with many-valued logic

    • Reiner Hähnle, Werner Kernig
    Pages 158-169

  16. Deciding in HFS-theory via linear integer programming

    • M. Hibti, H. Lombardi, B. Legeard
    Pages 170-181

  17. The completion of typed logic programs and SLDNF-resolution

    • P. M. Hill
    Pages 182-193

  18. Increasing the versatility of heuristic based theorem provers

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

  19. Sequentialization of parallel logic programs with mode analysis

    • B. C. Massey, E. Tick
    Pages 205-216

  20. Refinements and extensions of model elimination

    • Klaus Mayr
    Pages 217-228
Back to top

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation