Graph-Based Proof Procedures for Horn Clauses

ISBN-13: 9780817635305 / Angielski / Miękka / 1990 / 150 str.

S. Raatz; Stan Raatz;Raatz

Opis

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.

Spis treści

Preliminaries.- A Semantics for the Hornlog System.- The Hornlog Proof Procedure.- Soundness and Completeness Results I.- An Equational Extension.- The He † Refutation Method.- Soundness and Completeness Results II.- Appendix: Implementation Issues.