Probabilistic relational programming language

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A probabilistic relational programming language (PRPL) is a programming language specially designed to describe and infer with probabilistic relational models (PRMs).

A PRM is usually developed with a set of algorithms for reducing, inference about and discovery of concerned distributions, which are embedded into the corresponding PRPL. PRPLs often extend from a basic language. The inventors' choices of underlying basic language depend on the similarity of their relational models to the basic language's relational model, as well as commercial considerations and personal preference. For instance, Infer.NET is based on .NET framework, while PRISM extends from Prolog.

Currently there are several PRPLs in active development, some of them have advanced to the beta stage. However because PRMs are new, up to year 2010 there have been no well-known software projects utilizing those languages.

Contents

List of probabilistic relational programming languages [edit]

Name Extends from
IBAL[1] OCAML
PRISM[2] B-Prolog
Infer.NET[3] .NET Framework
dimple [4] MATLAB, Java
BLOG[5]  ?
PSQL[6] SQL
BUGS[7]  ?
FACTORIE[8] Scala
PMTK[9] Matlab
Alchemy[10] C++
Dyna[11] Prolog
Figaro[12] Scala
Church[13] Scheme
ProbLog[14] Prolog

See also [edit]

Notes [edit]

External links [edit]