Progress in Computer Science and Applied Logic

Graph-Based Proof Procedures for Horn Clauses

Authors: RAATZ

Free Preview

Buy this book

eBook $74.99
price for USA in USD (gross)
  • ISBN 978-1-4899-3556-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-0-8176-3530-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
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.

Table of contents (10 chapters)

Table of contents (10 chapters)

Buy this book

eBook $74.99
price for USA in USD (gross)
  • ISBN 978-1-4899-3556-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-0-8176-3530-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Graph-Based Proof Procedures for Horn Clauses
Authors
Series Title
Progress in Computer Science and Applied Logic
Series Volume
10
Copyright
1990
Publisher
Birkhäuser Basel
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4899-3556-4
DOI
10.1007/978-1-4899-3556-4
Softcover ISBN
978-0-8176-3530-5
Series ISSN
2297-0576
Edition Number
1
Number of Pages
VIII, 150
Number of Illustrations
8 b/w illustrations
Topics