Graph-Based Proof Procedures for Horn Clauses

  • Stan Raatz
Book

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

Table of contents

  1. Front Matter
    Pages i-viii
  2. Stan Raatz
    Pages 1-6
  3. Stan Raatz
    Pages 7-20
  4. Stan Raatz
    Pages 21-35
  5. Stan Raatz
    Pages 36-53
  6. Stan Raatz
    Pages 54-76
  7. Stan Raatz
    Pages 77-87
  8. Stan Raatz
    Pages 88-105
  9. Stan Raatz
    Pages 106-126
  10. Stan Raatz
    Pages 127-141
  11. Stan Raatz
    Pages 142-147
  12. Back Matter
    Pages 149-150

About this book

Introduction

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.

Keywords

logic Resolution semantics

Authors and affiliations

  • Stan Raatz
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4899-3556-4
  • Copyright Information Birkhäuser Boston 1990
  • Publisher Name Birkhäuser, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-0-8176-3530-5
  • Online ISBN 978-1-4899-3556-4
  • About this book