Gå direkte til innholdet
Graph-Based Proof Procedures for Horn Clauses
Spar

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.
Forfatter
RAATZ
Opplag
Softcover reprint of the original 1st ed. 1990
ISBN
9780817635305
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
1.12.1990
Antall sider
150