The magic of logical inference in probabilistic programming
From MaRDI portal
Publication:3087451
DOI10.1017/S1471068411000238zbMATH Open1222.68060arXiv1107.5152MaRDI QIDQ3087451FDOQ3087451
Authors: Bernd Gutmann, Ingo Thon, Angelika Kimmig, Maurice Bruynooghe, Luc De Raedt 
Publication date: 16 August 2011
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: Today, many different probabilistic programming languages exist and even more inference mechanisms for these languages. Still, most logic programming based languages use backward reasoning based on SLD resolution for inference. While these methods are typically computationally efficient, they often can neither handle infinite and/or continuous distributions, nor evidence. To overcome these limitations, we introduce distributional clauses, a variation and extension of Sato's distribution semantics. We also contribute a novel approximate inference method that integrates forward reasoning with importance sampling, a well-known technique for probabilistic inference. To achieve efficiency, we integrate two logic programming techniques to direct forward sampling. Magic sets are used to focus on relevant parts of the program, while the integration of backward reasoning allows one to identify and avoid regions of the sample space that are inconsistent with the evidence.
Full work available at URL: https://arxiv.org/abs/1107.5152
Recommendations
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Probabilistic logic programming for hybrid relational domains
- Approximate Inference for Logic Programs with Annotated Disjunctions
- scientific article; zbMATH DE number 7102019
- CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods
Cites Work
Cited In (24)
- Improving the efficiency of Gibbs sampling for probabilistic logical models by means of program specialization
- Probabilistic logic programming for hybrid relational domains
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Probabilistic programming language and its incremental evaluation
- Declarative probabilistic programming with Datalog
- Relax, compensate and then recover: a theory of anytime, approximate inference
- Probabilistic programming inference via intensional semantics
- Semirings for probabilistic and neuro-symbolic logic programming
- A semantics for hybrid probabilistic logic programs with function symbols
- Continualization of probabilistic programs with correction
- Towards an approximative ontology-agnostic approach for logic programs
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- AQUA: automated quantized inference for probabilistic programs
- Learning Distributional Programs for Relational Autocompletion
- Probabilistic abductive logic programming using Dirichlet priors
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
- Probabilistic (logic) programming concepts
- CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods
- Planning in hybrid relational MDPs
- Declarative probabilistic logic programming in discrete-continuous domains
- Structured learning modulo theories
- Probabilistic inference by hashing and optimization
- Generative Datalog and answer set programming (extended abstract)
- Implementing a library for probabilistic programming using non-strict non-determinism
Uses Software
This page was built for publication: The magic of logical inference in probabilistic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087451)
