Abstract
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks.
Original language | English |
---|---|
Pages (from-to) | 3-17 |
Number of pages | 15 |
Journal | International Journal of Approximate Reasoning |
Volume | 49 |
Issue number | 1 |
DOIs | |
Publication status | Published - Sept 2008 |
Keywords
- Linear and multilinear programming