Siirry suoraan sisältöön
Graph-Based Proof Procedures for Horn Clauses
Tallenna

Graph-Based Proof Procedures for Horn Clauses

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.
Kirjailija
RAATZ
Painos
Softcover reprint of the original 1st ed. 1990
ISBN
9780817635305
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
1.12.1990
Sivumäärä
150