Large probabilistic models are often shaped by a pool of known individuals (a universe) and relations between them. Lifted inference algorithms handle sets of known individuals for tractable inference. Universes may not always be known, though, or may only described by assumptions such as “small universes are more likely”. Without a universe, inference is no longer possible for lifted algorithms, losing their advantage of tractable inference. The aim of this paper is to define a semantics for models with unknown universes decoupled from a specific constraint language to enable lifted and thereby, tractable inference.
CITATION STYLE
Braun, T., & Möller, R. (2019). Exploring Unknown Universes in Probabilistic Relational Models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11919 LNAI, pp. 91–103). Springer. https://doi.org/10.1007/978-3-030-35288-2_8
Mendeley helps you to discover research relevant for your work.