ITEM METADATA RECORD
Title: Probabilistic inductive logic programming
Authors: De Raedt, Luc ×
Kersting, Kristian #
Issue Date: 2004
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3244 pages:19-36
Abstract: Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integration of probabilistic reasoning with first order logic representations and machine learning. A rich variety of different formalisms and learning techniques have been developed. In the present paper, we start from inductive logic programming and sketch how it can be extended with probabilistic methods. More precisely, we outline three classical settings for inductive logic programming, namely learning from entailment, learning from interpretations, and learning from proofs or traces, and show how they can be used to learn different types of probabilistic representations.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Non-KU Leuven Association publications
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
04-altds-invited.pdf Published 197KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science