Jump to content

Probabilistic programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ligon1 (talk | contribs) at 02:40, 12 January 2011 (Created page with 'A probabilistic relational language(PRL) is a programming language specially designed to describe and infer with probabilistic relational model(PRM)s. A PRM is us...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A probabilistic relational language(PRL) is a programming language specially designed to describe and infer with probabilistic relational model(PRM)s.

A PRM is usually developed with a set of algorithm for reducing, inference and discovery of concerned distributions, which are embedded into the corresponding PRL. PRLs often extend from a basic language. The inventors' choices of underlying basic language depend on the similarity of their relational models with the basic language's relational model, as well as commercial consideration and personal preference. For instance, Infer.NET is based on .NET framework and C#, while PRISM extends from Prolog. Due to their relational nature, most PRLs has a Logic programming language as their basic language.

Currently there are several PRLs in active development, some of them has advanced to the beta stage. Because PRMs are novice, until year 2010 there are no well known software projects utilizing those languages.

List of probabilistic relational languages

Note: The list may not be complete.