TY - JOUR
T1 - Probabilistic logic with independence
AU - Cozman, Fabio Gagliardi
AU - de Campos, Cassio Polpo
AU - Ferreira da Rocha, José Carlos
PY - 2008/9/1
Y1 - 2008/9/1
N2 - 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. © 2007 Elsevier Inc. All rights reserved.
AB - 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. © 2007 Elsevier Inc. All rights reserved.
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=48849087790&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=48849087790&origin=inward
U2 - 10.1016/j.ijar.2007.08.002
DO - 10.1016/j.ijar.2007.08.002
M3 - Article
SP - 3
EP - 17
JO - International Journal of Approximate Reasoning
JF - International Journal of Approximate Reasoning
SN - 0888-613X
ER -