Tipsa dina vänner om produkten:
Graph-Based Proof Procedures for Horn Clauses - Progress in Computer Science and Applied Logic Raatz Softcover reprint of the original 1st ed. 1990 edition
Pris
SEK 579
Beställningsvara
Förväntad leverans 6 - 14 okt
Få avisering om nya utgåvor med Raatz
Lägg till din iMusic-önskelista
eller
Graph-Based Proof Procedures for Horn Clauses - Progress in Computer Science and Applied Logic
Raatz
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.
160 pages
| Media | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 1 december 1990 |
| ISBN13 | 9780817635305 |
| Utgivare | Birkhauser Boston Inc |
| Antal sidor | 150 |
| Mått | 155 × 235 × 9 mm · 231 g |
| Språk | Engelska |