Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2016.15
URN: urn:nbn:de:0030-drops-67459
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6745/
Nampally, Arun ; Ramakrishnan, C. R.
Inference in Probabilistic Logic Programs Using Lifted Explanations
| pdf-format: |
|
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 graph". 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.
BibTeX - Entry
@InProceedings{nampally_et_al:OASIcs:2016:6745,
author = {Arun Nampally and C. R. Ramakrishnan},
title = {{Inference in Probabilistic Logic Programs Using Lifted Explanations}},
booktitle = {Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
pages = {15:1--15:15},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-007-1},
ISSN = {2190-6807},
year = {2016},
volume = {52},
editor = {Manuel Carro and Andy King and Neda Saeedloei and Marina De Vos},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6745},
URN = {urn:nbn:de:0030-drops-67459},
doi = {10.4230/OASIcs.ICLP.2016.15},
annote = {Keywords: Probabilistic logic programs, Probabilistic inference, Lifted inference, Symbolic evaluation, Constraints}
}
| Keywords: | Probabilistic logic programs, Probabilistic inference, Lifted inference, Symbolic evaluation, Constraints | |
| Seminar: | Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 11.11.2016 |
