A least common subsumer operation for an expressive description logic

Authors:
Thomas Mantay
Affiliations:
-
Venue:
IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
Year:
2000

Citing 5
Cited 0

The Learnability of Description Logics with Equality Constraints

Machine Learning - Special issue on computational learning theory, COLT'92
Reasoning in description logics

Principles of knowledge representation
Computing Least Common Subsumers in Description Logics with Existential Restrictions

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions

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

Quantified Score

Hi-index	0.00

Visualization

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, for the "bottom-up" construction of knowledge bases, for 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 operation for the expressive description logic ALQ featuring qualified number restrictions.