Abstract
Uncertainty reasoning and inconsistency handling are two important problems that often occur in the applications of the Semantic Web, such as the areas like medicine and biology [2]. Possibilistic description logics, first proposed by Hollunder in [1], are extension of description logics with possibilistic semantics. It is well-known that possibilistic logic is a powerful logical framework for dealing with uncertainty and handling inconsistency.
Guilin Qi is partially supported by the EU under the IST project NeOn and the X-Media project, and Jeff Z. Pan is partially supported by the EU MOST project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hollunder, B.: An alternative proof method for possibilistic logic and its application to terminological logics. In: Proc. of UAI 1994, pp. 327–335 (1994)
Udrea, O., Deng, Y., Hung, E., Subrahmanian, V.S.: Probabilistic ontologies and relational databases. In: Proc. of CoopIS/DOA/ODBASE 2005, pp. 1–17 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qi, G., Pan, J.Z. (2008). A Tableau Algorithm for Possibilistic Description Logic \(\mathcal{ALC}\). In: Calvanese, D., Lausen, G. (eds) Web Reasoning and Rule Systems. RR 2008. Lecture Notes in Computer Science, vol 5341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88737-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-88737-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88736-2
Online ISBN: 978-3-540-88737-9
eBook Packages: Computer ScienceComputer Science (R0)