Skip to main content
SpringerLink
Log in
Birkhäuser
Book cover

Graph-Based Proof Procedures for Horn Clauses

  • Book
  • © 1990

Overview

Authors:
  1. Stan Raatz

    1. Department of Computer Science, Rutgers University, New Brunswick, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Progress in Computer Science and Applied Logic (PCS, volume 10)

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Pages i-viii
    Download chapter PDF

  2. Introduction

    • Stan Raatz
    Pages 1-6

  3. Preliminaries

    • Stan Raatz
    Pages 7-20

  4. A Semantics for the Hornlog System

    • Stan Raatz
    Pages 21-35

  5. The Hornlog Proof Procedure

    • Stan Raatz
    Pages 36-53

  6. Soundness and Completeness Results I

    • Stan Raatz
    Pages 54-76

  7. An Equational Extension

    • Stan Raatz
    Pages 77-87

  8. The He † Refutation Method

    • Stan Raatz
    Pages 88-105

  9. Soundness and Completeness Results II

    • Stan Raatz
    Pages 106-126

  10. Appendix: Implementation Issues

    • Stan Raatz
    Pages 127-141

  11. Bibliography

    • Stan Raatz
    Pages 142-147

  12. Back Matter

    Pages 149-150
    Download chapter PDF
Back to top

Keywords

About this book

The origins of this monograph lie in my Ph.D. dissertation of 1987 at the University of Pennsylvania, which was concerned with proof procedures for the Horn clause subset of logic. The rise of logic programming has made this an important area of study. All Prologs are based on a variant of resolution, and inherit various properties related to this proof method. This monograph studies the paradigm of logic programming in the context of graph-based proof procedures which are unrelated to resolution. The monograph is not a general introduction to logic programming, although it is self-contained with respect to the mathematics used. It should appeal to the computer scientist or mathematician interested in the general area we now call computational logic. A large part of the monograph is devoted to detailed proofs that the methods we present are sound and complete, which in the context of the logic programming, means that the operational and denotational semantics agree.

Authors and Affiliations

  • Department of Computer Science, Rutgers University, New Brunswick, USA

    Stan Raatz

Bibliographic Information

  • Book Title: Graph-Based Proof Procedures for Horn Clauses

  • Authors: Stan Raatz

  • Series Title: Progress in Computer Science and Applied Logic

  • DOI: https://doi.org/10.1007/978-1-4899-3556-4

  • Publisher: Birkhäuser Boston, MA

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1990

  • Softcover ISBN: 978-0-8176-3530-5Published: 01 December 1990

  • eBook ISBN: 978-1-4899-3556-4Published: 21 November 2013

  • Series ISSN: 2297-0576

  • Series E-ISSN: 2297-0584

  • Edition Number: 1

  • Number of Pages: VIII, 150

  • Number of Illustrations: 8 b/w illustrations

  • Topics: Science, Humanities and Social Sciences, multidisciplinary

Publish with us

Policies and ethics

Back to top

Search

Navigation