Probabilistic logic programming for hybrid relational domains

We introduce a probabilistic language and an efficient inference algorithm based on distributional clauses for static and dynamic inference in hybrid relational domains. Static inference is based on sampling, where the samples represent (partial) worlds (with discrete and continuous variables). Furt...

Full description

Saved in:
Bibliographic Details
Published in:Machine learning Vol. 103; no. 3; pp. 407 - 449
Main Authors: Nitti, Davide, De Laet, Tinne, De Raedt, Luc
Format: Journal Article
Language:English
Published: New York Springer US 01.06.2016
Springer Nature B.V
Subjects:
ISSN:0885-6125, 1573-0565, 1573-0565
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first