Graph-Based Proof Procedures for Horn Clauses Stan Raatz

ISBN: 9780817635305

Published: December 1st 1990

Paperback

150 pages


Description

Graph-Based Proof Procedures for Horn Clauses  by  Stan Raatz

Graph-Based Proof Procedures for Horn Clauses by Stan Raatz
December 1st 1990 | Paperback | PDF, EPUB, FB2, DjVu, AUDIO, mp3, RTF | 150 pages | ISBN: 9780817635305 | 9.18 Mb

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 ofMoreThe 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.



Enter the sum





Related Archive Books



Related Books


Comments

Comments for "Graph-Based Proof Procedures for Horn Clauses":


jamesengland.eu

©2014-2015 | DMCA | Contact us