Open AccessProceedings Article
IBAL: a probabilistic rational programming language
Avi Pfeffer
- 04 Aug 2001
- pp 733-740
196
TL;DR: A detailed account of the syntax and semantics of IBAL, a rational programming language for probabilistic and decision-theoretic agents, as well as an overview of the implementation are presented.
read more
Abstract: In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the situation. This paper presents IBAL, a rational programming language for probabilistic and decision-theoretic agents. IBAL provides a rich declarative language for describing probabilistic models. The expression language allows the description of arbitrarily complex generative models. In addition, IBAL’s observation language makes it possible to express and compose rejective models that result from conditioning on the observations. IBAL also integrates Bayesian parameter estimation and decisiontheoretic utility maximization thoroughly into the framework. All these are packaged together into a programming language that has a rich type system and built-in extensibility. This paper presents a detailed account of the syntax and semantics of IBAL, as well as an overview of the implementation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Probabilistic machine learning and artificial intelligence
TL;DR: This Review provides an introduction to this framework, and discusses some of the state-of-the-art advances in the field, namely, probabilistic programming, Bayesian optimization, data compression and automatic model discovery.
•Proceedings Article
Church: a language for generative models
Noah D. Goodman,Vikash K. Mansinghka,Daniel M. Roy,Keith Bonawitz,Joshua B. Tenenbaum +4 more
- 09 Jul 2008
TL;DR: Church as mentioned in this paper is a universal language for describing stochastic generative processes, which is based on the Lisp model of lambda calculus, containing a pure Lisp as its deterministic subset.
•Proceedings Article
BLOG: Probabilistic Models with Unknown Objects
Brian Milch,Bhaskara Marthi,Stuart Russell,David Sontag,Daniel L. Ong,Andrey Kolobov +5 more
- 01 Jan 2006
TL;DR: The BLOG model as discussed by the authors is a formal language for defining probability models with unknown objects and identity uncertainty, and it can be used to describe a generative process in which some steps add objects to the world, and others determine attributes and relations on these objects.
428
•Book
Statistical Relational Artificial Intelligence: Logic, Probability, and Computation
Luc De Raedt,Kristian Kersting,Sriraam Natarajan +2 more
- 24 Mar 2016
TL;DR: This book focuses on two representations in detail: Markov logic networks, a relational extension of undirected graphical models and weighted first-order predicate calculus formula, and Problog, a probabilistic extension of logic programs that can also be viewed as a Turing-complete relational extensions of Bayesian networks.
306
Turing: A Language for Flexible Probabilistic Inference
Hong Ge,Kai Xu,Zoubin Ghahramani +2 more
- 31 Mar 2018
TL;DR: This paper aims to demonstrate the efforts towards in-situ applicability of EMMARM, which aims to provide real-time information about concrete mechanical properties such as E-modulus and compressive strength.
References
Training products of experts by minimizing contrastive divergence
TL;DR: A product of experts (PoE) is an interesting candidate for a perceptual system in which rapid inference is vital and generation is unnecessary because it is hard even to approximate the derivatives of the renormalization term in the combination rule.
•Proceedings Article
SPOOK: a system for probabilistic object-oriented knowledge representation
Avi Pfeffer,Daphne Koller,Brian Milch,Ken T. Takusagawa +3 more
- 30 Jul 1999
TL;DR: SPOOK implements a more expressive language that allows it to represent the battlespace domain naturally and compactly, and presents a new inference algorithm that utilizes the model structure in a fundamental way, and shows empirically that it achieves orders of magnitude speedup over existing approaches.
123
•Posted Content
SPOOK: A System for Probabilistic Object-Oriented Knowledge Representation
TL;DR: SPOOK as mentioned in this paper implements a more expressive language that allows it to represent the battlespace domain naturally and compactly, and shows empirically that it achieves orders of magnitude speedup over existing approaches.
110
•Proceedings Article
Relational Representations that Facilitate Learning
Chad Cumby,Dan Roth +1 more
- 01 Dec 1999
TL;DR: This work develops an expressive relational representation language that allows the use of propositional learning algorithms when learning relational definitions and allows for hierarchical composition of relational expressions that can be evaluated efficiently on the observations and thus supports learning complex definitions by learning simple functions of the intermediate representations.
30
•Proceedings Article
Effective Bayesian inference for stochastic programs
Daphne Koller,David McAllester,Avi Pfeffer +2 more
- 27 Jul 1997
TL;DR: This paper proposes a stochastic version of a general purpose functional programming language that contains random choices, conditional statements, structured values, defined functions, and recursion, and provides an exact algorithm for computing conditional probabilities of the form Pr(P(x) | Q(x)) where x is chosen randomly from this distribution.