Title: Domain and combining rules in Bayesian logic programs
Authors: Fierens, Daan ×
Blockeel, Hendrik
Ramon, Jan #
Issue Date: Mar-2004
Conference: 5th "Freiburg, Leuven and Friends" Workshop on Machine Learning location:Hinterzarten, Germany date:8-10 March 2004
Abstract: This talk consists of two parts. In the first part we analyze Bayesian Logic Programs from a knowledge representation point of view. We discuss the importance of (unlike BLPs) distinguishing so called probabilistic atoms and logical/deterministic atoms. We give a rough outline of a language that is insprired on BLPs and that makes this distinction.
In the second part of this talk we discuss learning combining rules for BLPs under the form of trees. While this is future work, we already try to explain on a high level how this could be done and why it seems promising.
Publication status: published
KU Leuven publication type: IMa
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
41195_slides.pdf Published 199KbAdobe PDFView/Open


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