@inproceedings{55e55d79d1a4402bb8f21b5a9b996763,
title = "Inference in probabilistic logic programs using lifted explanations",
abstract = "In this paper, we consider the problem of lifted inference in the context of Prism-like probabilistic logic programming languages. Traditional inference in such languages involves the construction of an explanation graph for the query that treats each instance of a random variable separately. For many programs and queries, we observe that explanations can be summarized into substantially more compact structures introduced in this paper, called {"}lifted explanation graphs{"}. In contrast to existing lifted inference techniques, our method for constructing lifted explanations naturally generalizes existing methods for constructing explanation graphs. To compute probability of query answers, we solve recurrences generated from the lifted graphs. We show examples where the use of our technique reduces the asymptotic complexity of inference.",
keywords = "Constraints, Lifted inference, Probabilistic inference, Probabilistic logic programs, Symbolic evaluation",
author = "Arun Nampally and Ramakrishnan, \{C. R.\}",
note = "Publisher Copyright: {\textcopyright} Arun Nampally and C. R. Ramakrishnan.; 32nd International Conference on Logic Programming, ICLP 2016 ; Conference date: 16-10-2016 Through 21-10-2016",
year = "2016",
month = nov,
day = "1",
doi = "10.4230/OASIcs.ICLP.2016.15",
language = "English",
series = "OpenAccess Series in Informatics",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Andy King and Neda Saeedloei and \{De Vos\}, Marina and Linares, \{Manuel Carro\}",
booktitle = "Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016",
}