Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Graph-Based Proof Procedures for Horn Clauses

Graph-Based Proof Procedures for Horn Clauses

Raatz

Paperback

Series: Progress in Computer Science and Applied Logic, Book 10

Gifts & Stationery GeneralGeneral ScienceProgramming

ISBN10: 0817635300
ISBN13: 9780817635305
Publisher: Birkhauser
Published: Dec 1 1990
Pages: 150
Weight: 0.51
Height: 0.34 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

Programming

View All