Tractable reasoning with bayesian description logics

Journal article

The DL-Lite family 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-Lite description 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-Lite description 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-Lite family. 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. © 2008 Springer-Verlag.

Authors: D'Amato, C; Fanizzi, N; Lukasiewicz, T

• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Volume: 5291 LNAI
• Pages: 146-159
• Publication date: 2008-01-01
• DOI: 10.1007/978-3-540-87993-0_13
• EISSN: 1611-3349
• ISSN: 0302-9743
• Language: English
• Keywords: Description logics; Semantic web; Bayesian description logics; Tractable reasoning; Ontologies; Bayesian networks; DL-Lite