Probabilistic (logic) programming concepts

From MaRDI portal
Publication:894692

DOI10.1007/S10994-015-5494-ZzbMATH Open1346.68050arXiv1312.4328OpenAlexW811924890MaRDI QIDQ894692FDOQ894692


Authors: Luc De Raedt, Angelika Kimmig Edit this on Wikidata


Publication date: 2 December 2015

Published in: Machine Learning (Search for Journal in Brave)

Abstract: A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with primitives to support modeling of complex, structured probability distributions. Each of these languages employs its own probabilistic primitives, and comes with a particular syntax, semantics and inference procedure. This makes it hard to understand the underlying programming concepts and appreciate the differences between the different languages. To obtain a better understanding of probabilistic programming, we identify a number of core programming concepts underlying the primitives used by various probabilistic languages, discuss the execution mechanisms that they require and use these to position state-of-the-art probabilistic languages and their implementation. While doing so, we focus on probabilistic extensions of logic programming languages such as Prolog, which have been developed since more than 20 years.


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




Recommendations




Cites Work


Cited In (41)

Uses Software





This page was built for publication: Probabilistic (logic) programming concepts

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