The magic of logical inference in probabilistic programming

DOI10.1017/S1471068411000238zbMath1222.68060arXiv1107.5152MaRDI QIDQ3087451

Angelika Kimmig, Ingo Thon, Maurice Bruynooghe, Luc De Raedt, Bernd Gutmann

Publication date: 16 August 2011

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

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

zbMATH Keywords

samplingcontinuous distributionsprobabilistic logicforward reasoning

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (9)

Probabilistic logic programming for hybrid relational domains ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Learning Distributional Programs for Relational Autocompletion ⋮ Probabilistic (logic) programming concepts ⋮ A new probabilistic constraint logic programming language based on a generalised distribution semantics ⋮ Planning in hybrid relational MDPs ⋮ PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control ⋮ A semantics for hybrid probabilistic logic programs with function symbols ⋮ Structured learning modulo theories

Uses Software

• ProbLog
• IBAL
• Church

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: The magic of logical inference in probabilistic programming