Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Inductive Temporal Logic Programming

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

Learning Temporal Logic Programs from Examples

Robert Kolter

Language

English

Book Paperback

Libristo code: 06987318

Publishers Sudwestdeutscher Verlag Fur Hochschulschriften AG, October 2010

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

Libristo code: 06987318

239 b

34 716 Ft

Print on demand Shipping in 17-27 days

Up to 30 days for returns

Customers also purchased

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

Paperback

5 167 Ft

Aphrodite Pierre Louys

Paperback

4 279 Ft

Im Vollbesitz des eigenen Wahns Hilary Mantel

Paperback

4 106 Ft

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

Paperback

3 964 Ft

BODHICARYAVATRA LA MARCHE VERS L EVEIL NOUVELLE TRADUCTION SHANTIDEVA

Hardback

8 463 Ft

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.