First-order probabilistic languages: Into the unknown

22Citations
Citations of this article
52Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper surveys first-order probabilistic languages (FOPLs), which combine the expressive power of first-order logic with a probabilistic treatment of uncertainty. We provide a taxonomy that helps make sense of the profusion of FOPLs that have been proposed over the past fifteen years. We also emphasize the importance of representing uncertainty not just about the attributes and relations of a fixed set of objects, but also about what objects exist. This leads us to Bayesian logic, or BLOG, a language for defining probabilistic models with unknown objects. We give a brief overview of BLOG syntax and semantics, and emphasize some of the design decisions that distinguish it from other languages. Finally, we consider the challenge of constructing FOPL models automatically from data. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Milch, B., & Russell, S. (2007). First-order probabilistic languages: Into the unknown. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4455 LNAI, pp. 10–24). Springer Verlag. https://doi.org/10.1007/978-3-540-73847-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free