PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control

DOI10.1016/j.ijar.2018.10.012zbMath1448.68202OpenAlexW2898028885MaRDI QIDQ1726305

Samer A. Abdallah

Publication date: 20 February 2019

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2018.10.012

zbMATH Keywords

logic programmingmachine learningprobabilistic programmingdelimited continuationsalgebraic effect handlers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Theory of programming languages (68N15) Logic programming (68N17)

Uses Software

• Haskell
• ProbLog
• IBAL
• Church
• Dyna
• PRISM
• Anglican

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variational Bayes via propositionalized probability computation in PRISM
• Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
• Probabilistic logic programming
• Probabilistic Horn abduction and Bayesian networks
• Tabling for non-monotonic programming
• Approximating exponential models
• Online Model Selection Based on the Variational Bayes
• Handling Algebraic Effects
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• The magic of logical inference in probabilistic programming
• Theory and practice of constraint handling rules
• Comprehending monads
• Viterbi training in PRISM
• Tabling as a library with delimited control
• Efficient algebraic effect handlers for Prolog
• Delimited continuations for prolog
• Towards Typed Prolog
• FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

This page was built for publication: PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control