KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Wed, 06 Oct 2010 10:41:03 +0200Wed, 06 Oct 2010 10:41:03 +0200Inductive Temporal Logic Programming
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2241
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.Robert Kolterdoctoralthesishttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2241Wed, 06 Oct 2010 10:41:03 +0200Theorem Proving in Higher Order Logics - Emerging Trends
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2100
This technical report is the Emerging Trends proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007), which was held during 10-13 September in Kaiserslautern, Germany. TPHOLs covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and veriﬁcation.Klaus Schneider; Jens Brandtconferenceobjecthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2100Wed, 03 Jun 2009 14:54:52 +0200