Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.49 € Zbirna točka DPD 2.99 € Kurirska služba GLS 5.49 € Kurir DPD 3.49 € Kurirska služba 3.49 € Zbirno mesto 3.49 € Zbirno mesto 3.49 € Dostava preko Pošte Slovenije 3.49 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Inductive Temporal Logic Programming

Name: Inductive Temporal Logic Programming
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften AG
SKU: 06987318
Price: 88.51 EUR
Availability: InStock
Author: Robert Kolter
ISBN: 9783838121499

Learning Temporal Logic Programs from Examples

Robert Kolter

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 06987318

Založba Sudwestdeutscher Verlag Fur Hochschulschriften AG, oktober 2010

We study the extension of techniques from Inductive Logic Programming (ILP) to temporal logic progra... Celoten opis

Koda Libristo: 06987318

214 b

88.51 €

Od založnika po naročilu Odposlali bomo v 17-27 dneh

30 dni za vračilo blaga

Drugi so kupili tudi

Quels sont les moyens de fonder la morale chez un peuple Destutt de Tracy

Mehka

13.03 €

Aphrodite Pierre Louys

Mehka

11.00 €

Im Vollbesitz des eigenen Wahns Hilary Mantel

Mehka

9.49 €

Qu'avons-Nous Fait de Nos Rves? Jennifer Egan

Mehka

10.30 €

BODHICARYAVATRA LA MARCHE VERS L EVEIL NOUVELLE TRADUCTION SHANTIDEVA

Trda

21.92 €

We study the extension of techniques from Inductive Logic Programming (ILP) to temporal logic programming languages. Therefore we present two temporal logic programming languages and analyse the learnability of programs from these languages from finite sets of examples. In first order temporal logic the following topics are analysed: How can we characterize the denotational semantics of programs? Which proof techniques are best suited? How complex is the learning task? In propositional temporal logic we analyse the following topics: How can we use well known techniques from model checking in order to refine programs? How complex is the learning task? In both cases we present estimations for the VC-dimension of selected classes of programs.