Probabilistic logic with independence

Fábio Gagliardi Cozman, Cassio Polpo de Campos, José Carlos Ferreira da Rocha

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.