Abstract
Computing the most specific concept (msc) is an inference task that allows to abstract from individuals defined in description logic (DL) knowledge bases. For DLs that allow for existential restrictions or number restrictions, however, the msc need not exist unless one allows for cyclic concepts interpreted with the greatest fixed-point semantics. Since such concepts cannot be handled by current DL-systems, we propose to approximate the msc. We show that for the DL ALE, which has concept conjunction, a restricted form of negation, existential restrictions, and value restrictions as constructors, approximations of the msc always exist and can effectively be computed.
This work was carried out while the author was still at the LuFG Theoretische Informatik, RWTH Aachen, Germany.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
F. Baader and R. Küsters. Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In Proc. Of KI’98, LNAI 1504, pp 129–140. Springer-Verlag, 1998.
F. Baader, R. Küsters, and R. Molitor. Computing least common subsumers in description logics with existential restrictions. In Proc. of IJCAI’99, pp 96–101. Morgan Kaufmann, 1999.
F. Baader and R. Molitor. Building and structuring description logic knowledge bases using least common subsumers and concept analysis. In Proc. Of ICCS2000, LNAI 1867,pp 292–305. Springer-Verlag, 2000.
W.W. Cohen, A. Borgida, and H. Hirsh. Computing least common subsumers in description logics. In Proc. of AAAI’92, pp 754–760. MITPress, 1992.
M. Chein and M. Mugnier. Conceptual graphs: Fundamental notions. Revue d’Intelligence. 6(4):365–406, 1992.
W.W. Cohen and H. Hirsh. Learning the classic description logic: Theoretical and experimental results. In Proc. of KR’94, pp 121–132. Morgan Kaufmann, 1994.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
V. Haarslev and R. Möller. Expressive ABox reasoning with number restrictions, role hierarchies and transitively closed roles. In Proc. of KR2000, pp 273–284. Morgan Kaufmann, 2000.
I. Horrocks. Using an expressive description Logic: FaCTor fiction? In Proc. Of KR’98, pp 636–647. Morgan Kaufmann, 1998.
R. Küsters. Non-Standard Inference in Description Logics. PhD thesis, RWTH Aachen, 2000. To appear as volume 2100 of the Springer Lecture Notes in Artificial Intelligence.
R. Küsters and A. Borgida. What’s in an attribute? Consequences for the least common subsumer. Journal of Artificial Intelligence Research, 14: 167–203, 2001.
R. Küsters and R. Molitor. Computing least common subsumers in ALEN. In Proc. of IJCAI’01. Morgan Kaufmann, 2001. To appear.
R. Küsters and R. Molitor.Computing most specific concepts in description logics with existential restrictions. Technical Report LTCS-00-05. See http://wwwlti.informatik.rwth-aachen.de/Forschung/Reports.html.
B. Nebel. Reasoning and Revision in Hybrid Representation Systems. LNAI 422, Springer-Verlag, 1990.
A. Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems, 2:265–278, 1993.
L. von Wedel and W. Marquardt. ROME: A repository to support the integration of models over the lifecycle of model-based engineering processes. In Proc. Of ESCAPE-10, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Küsters, R., Molitor, R. (2001). Approximating Most Specific Concepts in Description Logics with Existential Restrictions. In: Baader, F., Brewka, G., Eiter, T. (eds) KI 2001: Advances in Artificial Intelligence. KI 2001. Lecture Notes in Computer Science(), vol 2174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45422-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-45422-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42612-7
Online ISBN: 978-3-540-45422-9
eBook Packages: Springer Book Archive