Loading...
Please wait, while we are loading the content...
Similar Documents
Probabilistic Description Logics for the Semantic Web Probabilistic Description Logics for the Semantic Web
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lukasiewicz, Thomas |
| Copyright Year | 2007 |
| Abstract | The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role in the development of the Semantic Web, since they provide a precise definition of shared terms in web resources. They are expressed in the standardized web ontology language OWL, which consists of the three increasingly expressive sublanguages OWL Lite, OWL DL, and OWL Full. The sublanguages OWL Lite and OWL DL have a formal semantics and a reasoning support through a mapping to the expressive description logics SHIF(D) and SHOIN (D), respectively. In this paper, we present the expressive probabilistic description logics P-SHIF(D) and P-SHOIN (D), which are probabilistic extensions of these description logics. They allow for expressing rich terminological probabilistic knowledge about concepts and roles as well as assertional probabilistic knowledge about instances of concepts and roles. They are semantically based on the notion of probabilistic lexicographic entailment from probabilistic default reasoning, which naturally interprets this terminological and assertional probabilistic knowledge as knowledge about random and concrete instances, respectively. As an important additional feature, they also allow for expressing terminological default knowledge, which is semantically interpreted as in Lehmann’s lexicographic entailment in default reasoning from conditional knowledge bases. We then present sound and complete algorithms for the main reasoning problems in the new probabilistic description logics, which are based on reductions to reasoning in their classical counterparts, and to solving linear optimization problems. In particular, this shows the important result that reasoning in the new probabilistic description logics is decidable / computable. Furthermore, we also analyze the computational complexity of the main reasoning problems in the new probabilistic description logics in the general as well as restricted cases. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, I-00198 Rome, Italy; e-mail: lukasiewicz@dis.uniroma1.it. Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria; e-mail: lukasiewicz@kr.tuwien.ac.at. Acknowledgements: This paper is a significantly extended and revised version of a paper that appeared in: Proceedings JELIA-2002, volume 2424 of LNCS, pp. 86–97. Springer, 2002 [30]. This work was supported by a Heisenberg Professorship of the German Research Foundation (DFG). I am very grateful to Rosalba Giugno for her contributions to the JELIA-2002 abstract of this paper. Copyright c © 2007 by the authors INFSYS RR 1843-06-05 I |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.kr.tuwien.ac.at/research/reports/rr0605.pdf |
| Alternate Webpage(s) | http://haendel.kr.tuwien.ac.at/research/reports/rr0605.pdf |
| Alternate Webpage(s) | http://www.kr.tuwien.ac.at/staff/lukasiew/rr0605.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
