Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Provjerite status narudžbe

Pridružite se zajednici ljubitelja knjige iz cijelog svijeta i ostvarite mnoštvo pogodnosti. Izradite besplatni račun

Besplatna dostava Overseas kurirskom službom iznad 69.99 €

DPD kurir 3.99 € Pošta 4.99 € Overseas 4.99 € Box Now 4.49 € GLS 4.99 € DPD točka 3.49 € GLS paketomat 3.99 €

Kontakt

Kako kupovati

Pomoć

Moj račun

▸ Prazno :-(

Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Inductive Temporal Logic Programming

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

Learning Temporal Logic Programs from Examples

Robert Kolter

Jezik

Engleski

Knjiga Meki uvez

Libristo kod: 06987318

Nakladnici Sudwestdeutscher Verlag Fur Hochschulschriften AG, listopad 2010

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

Libristo kod: 06987318

227 b

93.88 €

Po narudžbi kod izdavača Šaljemo za 17-27 dana

30 dana za povrat kupljenih proizvoda

Kupci su kupili i

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

Meki uvez

13.66 €

Aphrodite Pierre Louys

Meki uvez

11.54 €

Im Vollbesitz des eigenen Wahns Hilary Mantel

Meki uvez

10.02 €

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

Meki uvez

10.83 €

BODHICARYAVATRA LA MARCHE VERS L EVEIL NOUVELLE TRADUCTION SHANTIDEVA

Tvrdi uvez

23.08 €

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.