Lifted variable elimination for probabilistic logic programming

DOI10.1017/S1471068414000283MaRDI QIDQ2931273zbMATH OpenDBLPWikidataFDO

Authors Elena Bellodi, Evelina Lamma, Fabrizio Riguzzi, Vítor Costa, Riccardo Zese

Publication date 25 November 2014

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.3218

zbMATH Keywords

distribution semanticslifted inferenceprobabilistic logic programmingProbLogstatistical relational artificial intelligencevariable elimination

Mathematics Subject Classification ID

Logic programming (68N17) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Abstract: Lifted inference has been proposed for various probabilistic logical frameworks in order to compute the probability of queries in a time that depends on the size of the domains of the random variables rather than the number of instances. Even if various authors have underlined its importance for probabilistic logic programming (PLP), lifted inference has been applied up to now only to relational languages outside of logic programming. In this paper we adapt Generalized Counting First Order Variable Elimination (GC-FOVE) to the problem of computing the probability of queries to probabilistic logic programs under the distribution semantics. In particular, we extend the Prolog Factor Language (PFL) to include two new types of factors that are needed for representing ProbLog programs. These factors take into account the existing causal independence relationships among random variables and are managed by the extension to variable elimination proposed by Zhang and Poole for dealing with convergent variables and heterogeneous factors. Two new operators are added to GC-FOVE for treating heterogeneous factors. The resulting algorithm, called LP${}^2$ for Lifted Probabilistic Logic Programming, has been implemented by modifying the PFL implementation of GC-FOVE and tested on three benchmarks for lifted inference. A comparison with PITA and ProbLog2 shows the potential of the approach.

Recommendations

• A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
• Inference in probabilistic logic programs using lifted explanations
• Evaluating inference algorithms for the Prolog factor language
• Lifted discriminative learning of probabilistic logic programs
• MAP inference for probabilistic logic programming

Cites work

• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• Probabilistic Horn abduction and Bayesian networks
• Probabilistic inductive logic programming. Theory and applications
• The independent choice logic for modelling multiple agents under uncertainty

Cited in

(15)

• Causal inference in cplint
• A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
• Lifted discriminative learning of probabilistic logic programs
• Lifted variable elimination: decoupling the operators from the constraint language
• Generalized counting for lifted variable elimination
• Towards lifted inference under maximum entropy for probabilistic relational FO-PCL knowledge bases
• Constraint-based inference in probabilistic logic programs
• Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers
• Evaluating inference algorithms for the Prolog factor language
• Preventing groundings and handling evidence in the lifted junction tree algorithm
• MAP inference for probabilistic logic programming
• Inference in probabilistic logic programs using lifted explanations
• Learning effect axioms via probabilistic logic programming
• Lifted inference for statistical statements in probabilistic answer set programming
• Probabilistic (logic) programming concepts

This page was built for publication: Lifted variable elimination for probabilistic logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931273)