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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Der Autor studierte von 1998 bis 2003 Informatik an der TU Kaiserslautern. Nach dem Diplom im Jahr 2003 arbeitete er bis 2007 am Fachbereich Informatik der TU Kaiserslautern als wissenschaftlicher Mitarbeiter. Seit 2007 ist er als Softwareentwickler tätig. 2009 erfolgt die Promotion zum Doktor der Naturwissenschaften (Dr. rer. nat.).
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Inductive Temporal Logic Programming | Learning Temporal Logic Programs from Examples | Robert Kolter | Taschenbuch | Englisch | Südwestdeutscher Verlag für Hochschulschriften | EAN 9783838121499 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Codice articolo 107240296
Quantità: 5 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Codice articolo 9783838121499
Quantità: 2 disponibili