Abstract
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service can be used for the approximation of concept disjunctions in description logics, the “bottom-up” construction of knowledge bases, learning tasks, and for specific kinds of information retrieval. So far, computing the least common subsumer has been restricted to description logics with rather limited expressivity. In this article, we continue recent research on extending this operation to more complex languages and present a least common subsumer operator for the expressive description logic ALENR.
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.
References
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 O. Herzog and A. Günter, editors, Proceedings of the 22nd German Conference on Artificial Intelligence, KI’98, volume 1504, pages 129–140, 1998.
F. Baader, R. Küsters, and R. Molitor. Computing Least Common Subsumer in Description Logics with Existential Restrictions. In T. Dean, editor, Proceedings of the 16th International Joint Conference on AI (IJCAI’99), pages 96–101. Morgan Kaufmann, 1999.
W. W. Cohen, A. Borgida, and H. Hirsh. Computing Least Common Subsumers in Description Logics. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 1036–1043, Japan, 1992. Ass. for Computing Machinery.
W.W. Cohen and H. Hirsh. The learnability of description logics with equality constraints. Machine Learning, 17:169–199, 1994.
F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The Complexity of Concept Languages. Information and Computation, 134(1):1–58, April 1997.
F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Principles of Knowledge Representation, chapter Reasoning in Description Logics, pages 191–236. CSLI Publications, 1996.
T. Mantay. Computing Least Common Subsumers in Expressive Description Logics. TR FBI-HH-M-286/99, Dep. of CS, University of Hamburg, 1999.
R. Möller, V. Haarslev, and B. Neumann. Semantics-based Information Retrieval. In International Conference on Information Technology and Knowledge Systems, Vienna, Budapest, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mantay, T. (1999). Computing Least Common Subsumers in Expressive Description Logics. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive