Inference in probabilistic logic programs with continuous random variables
From MaRDI portal
Abstract: Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya's PRISM, Poole's ICL, Raedt et al's ProbLog and Vennekens et al's LPAD, is aimed at combining statistical and logical knowledge representation and inference. A key characteristic of PLP frameworks is that they are conservative extensions to non-probabilistic logic programs which have been widely used for knowledge representation. PLP frameworks extend traditional logic programming semantics to a distribution semantics, where the semantics of a probabilistic logic program is given in terms of a distribution over possible models of the program. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use of random variables with continuous distributions. In this paper, we present a symbolic inference procedure that uses constraints and represents sets of explanations without enumeration. This permits us to reason over PLPs with Gaussian or Gamma-distributed random variables (in addition to discrete-valued random variables) and linear equality constraints over reals. We develop the inference procedure in the context of PRISM; however the procedure's core ideas can be easily applied to other PLP languages as well. An interesting aspect of our inference procedure is that PRISM's query evaluation process becomes a special case in the absence of any continuous random variables in the program. The symbolic inference procedure enables us to reason over complex probabilistic models such as Kalman filters and a large subclass of Hybrid Bayesian networks that were hitherto not possible in PLP frameworks. (To appear in Theory and Practice of Logic Programming).
Recommendations
- Extending ProbLog with Continuous Distributions
- Probabilistic logic programming for hybrid relational domains
- Constraint-based inference in probabilistic logic programs
- A semantics for hybrid probabilistic logic programs with function symbols
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
Cites work
Cited in
(16)- A semantics for hybrid probabilistic logic programs with function symbols
- Probabilistic logic programming for hybrid relational domains
- Statistical statements in probabilistic logic programming
- Improving the efficiency of Gibbs sampling for probabilistic logical models by means of program specialization
- ProbLog Technology for Inference in a Probabilistic First Order Logic
- Constraint-based inference in probabilistic logic programs
- Continualization of probabilistic programs with correction
- Learning probabilistic logic programs over continuous data
- Structured learning modulo theories
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- Learning Distributional Programs for Relational Autocompletion
- Syntactic requirements for well-defined hybrid probabilistic logic programs
- Declarative probabilistic logic programming in discrete-continuous domains
- Probabilistic answer set programming with discrete and continuous random variables
- Automatic differentiation in Prolog
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
This page was built for publication: Inference in probabilistic logic programs with continuous random variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911131)
