Probabilistic logic with independence

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. Key words: Probabilistic Logic, Graph-theoretic Models, Sets of Probability Distributions, Linear and Multilinear Programming

• Type: Journal
• Year: 2008
• Where: IJAR
• Authors: Fabio Gagliardi Cozman, Cassio Polpo de Campos, José Carlos Ferreira da Rocha
• Keywords: IJAR 2008, Probabilistic Logic, Propositional Probabilistic Languages, Propositional Probabilistic Logic