Lifted inference aims at answering queries from statistical relational models by reasoning on populations of individuals as a whole instead of considering each individual singularly. Since the initial proposal by David Poole in 2003, many lifted inference techniques have appeared, by lifting different algorithms or using approximation involving different kinds of models, including parfactor graphs and Markov Logic Networks. Very recently lifted inference was applied to Probabilistic Logic Programming (PLP) under the distribution semantics, with proposals such as LP2 and Weighted First-Order Model Counting (WFOMC). Moreover, techniques for dealing with aggregation parfactors can be directly applied to PLP. In this paper we survey these approaches and present an experimental comparison on five models. The results show that WFOMC outperforms the other approaches, being able to exploit more symmetries.
|Titolo:||A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics|
RIGUZZI, Fabrizio (Primo) (Corresponding)
LAMMA, Evelina (Ultimo)
|Data di pubblicazione:||2017|
|Appare nelle tipologie:||03.1 Articolo su rivista|