Graph-Based Proof Procedures for Horn Clauses
Raatz
€ 63.95
FREE Delivery in Ireland
Description for Graph-Based Proof Procedures for Horn Clauses
Paperback. Series: Progress in Computer Science and Applied Logic. BIC Classification: YQS. Dimension: 235 x 155. Weight in Grams: 435.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
1990
Publisher
Birkhauser Boston
Language
English
Condition
New
Series
Progress in Computer Science and Applied Logic
Number of Pages
150
Place of Publication
Secaucus, United States
ISBN
9780817635305
SKU
V9780817635305
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Graph-Based Proof Procedures for Horn Clauses