Learning failure-free PRISM programs
First-order logic can be used to represent relations amongst objects. Probabilistic graphical models encode uncertainty over propositional data. Following the demand of combining the advantages of both representations, probabilistic logic programs provide the ability to encode uncertainty over relat...
Main Author: | Alsanie, Waleed |
---|---|
Other Authors: | Cussens, James |
Published: |
University of York
2012
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568108 |
Similar Items
-
Learning definite and normal logic programs by induction on failure
by: Kimber, Timothy
Published: (2012) -
A cognitive study of learning to program in introductory programming courses
by: Dehnadi, Saeed
Published: (2009) -
Models of programs and machine learning
by: Bone, Nicholas
Published: (1998) -
Efficient learning and evaluation of complex concepts in inductive logic programming
by: Santos, Jose Carlos Almeida Santos
Published: (2010) -
The design and construction of deadlock-free concurrent systems
by: Martin, Jeremy Malcolm Randolph
Published: (1996)