Probabilistic Logic with Independence

This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without independence, and 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 rst order probabilistic logic that gener-alizes relational Bayesian networks