The Learnability of Description Logics with Equality Constraints
Machine Learning - Special issue on computational learning theory, COLT'92
The complexity of concept languages
Information and Computation
Reasoning in description logics
Principles of knowledge representation
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Computing Least Common Subsumers in Expressive Description Logics
Computing Least Common Subsumers in Expressive Description Logics
Computing least common subsumers in description logics with existential restrictions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Lazy Induction of Descriptions for Relational Case-Based Learning
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
| Hi-index | 0.00 |
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 fax, 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.