Loopy Propagation in a Probabilistic Description Logic

  • Authors:
  • Fabio Gagliardi Cozman;Rodrigo Bellizia Polastro

  • Affiliations:
  • Escola Politécnica, Universidade de São Paulo, São Paulo, Brazil;Escola Politécnica, Universidade de São Paulo, São Paulo, Brazil

  • Venue:
  • SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper introduces a probabilistic description logic that adds probabilistic inclusions to the popular logic $\mathcal{ALC}$, and derives inference algorithms for inference in the logic. The probabilistic logic, referred to as cr$\mathcal{ALC}$ ("credal" $\mathcal{ALC}$), combines the usual acyclicity condition with a Markov condition; in this context, inference is equated with calculation of (bounds on) posterior probability in relational credal/Bayesian networks. As exact inference does not seem scalable due to the presence of quantifiers, we present first-order loopy propagation methods that seem to behave appropriately for non-trivial domain sizes.