Probabilistic programming language
||The topic of this article may not meet Wikipedia's general notability guideline. (June 2011)|
PPLs often extend from a basic language. The inventors' choices of underlying basic language depend on the similarity of their models to the basic language's ontology, as well as commercial considerations and personal preference. For instance, Infer.NET is based on .NET framework, while PRISM extends from Prolog. However, some PPLs such as WinBUGS and Stan define a self-contained language for their users to use, which is not obviously derived from a predecessor language.
Currently there are several PPLs 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.
Probabilistic relational programming language
A probabilistic relational programming language (PRPL) is a PPL 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.
List of probabilistic programming languages
|dimple ||MATLAB, Java|
- Infer.NET Home Page
- PRISM Home Page
- BUGS Home Page
- Stan homepage
- IBAL Home Page
- dimple Home Page
- BLOG Home Page
- PSQL: A query language for probabilistic relational data, D. Dey etc
- FACTORIE Home Page
- PMTK Home Page
- Alchemy Home Page
- Dyna Home Page
- Figaro Home Page
- Church Wiki Page
- ProbLog Home Page
- ProBT Download Page