Tractable Reasoning with Bayesian Description Logics

  • Authors:

  • Claudia D'Amato;Nicola Fanizzi;Thomas Lukasiewicz

  • Affiliations:

  • Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy 70125;Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy 70125;Computing Laboratory, University of Oxford, Oxford, UK OX1 3QD and Institut für Informationssysteme, Technische Universität Wien, Wien, Austria 1040

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

The DL-Litefamily of tractable description logics lies between the semantic web languages RDFS and OWL Lite. In this paper, we present a probabilistic generalization of the DL-Litedescription logics, which is based on Bayesian networks. As an important feature, the new probabilistic description logics allow for flexibly combining terminological and assertional pieces of probabilistic knowledge. We show that the new probabilistic description logics are rich enough to properly extend both the DL-Litedescription logics as well as Bayesian networks. We also show that satisfiability checking and query processing in the new probabilistic description logics is reducible to satisfiability checking and query processing in the DL-Litefamily. Furthermore, we show that satisfiability checking and answering unions of conjunctive queries in the new logics can be done in LogSpace in the data complexity. For this reason, the new probabilistic description logics are very promising formalisms for data-intensive applications in the Semantic Web involving probabilistic uncertainty.