Computing least common subsumers in ALEN

Authors:
Ralf Küsters;Ralf Molitor
Affiliations:
Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany;Swiss Life, IT Research and Development Group, Switzerland
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Year:
2001

Citing 3
Cited 6

Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis

ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
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

Approximating most specific concepts in description logics with existential restrictions

AI Communications - Special issue on KI-2001
Approximating Most Specific Concepts in Description Logics with Existential Restrictions

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Bibliography

The description logic handbook
A Compact Representation for Least Common Subsumers in the description logic ALE

AI Communications
Description logic-ground knowledge integration and management

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
Non-standard inferences in description logics

Non-standard inferences in description logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing the least common subsumer (lcs) has proved to be useful in a variety of different applications. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors, thereby correcting previous algorithms proposed in the literature.