Udvidet returret til d. 31. januar 2025

Graph-Based Proof Procedures for Horn Clauses - RAATZ - Bog

af RAATZ
Bag om 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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780817635305
  • Indbinding:
  • Paperback
  • Sideantal:
  • 150
  • Udgivet:
  • 1. december 1990
  • Udgave:
  • 11990
  • Vægt:
  • 435 g.
  • 8-11 hverdage.
  • 10. december 2024

Normalpris

  • BLACK WEEK

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af 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.

Brugerbedømmelser af Graph-Based Proof Procedures for Horn Clauses



Find lignende bøger
Bogen Graph-Based Proof Procedures for Horn Clauses findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.