Gå direkt till innehållet
Graph-Based Proof Procedures for Horn Clauses
Spara

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.
Författare
RAATZ
Upplaga
Softcover reprint of the original 1st ed. 1990
ISBN
9780817635305
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
1.12.1990
Sidor
150