Approximating Most Specific Concepts in Description Logics with Existential Restrictions

Authors:
Ralf Küsters;Ralf Molitor
Affiliations:
-;-
Venue:
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Year:
2001

Citing 9
Cited 7

Reasoning and revision in hybrid representation systems

Reasoning and revision in hybrid representation systems
On the complexity of the instance checking problem in concept languages with existential quantification

Journal of Intelligent Information Systems - Special issue on methodologies for intelligent systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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 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
What's in an attribute? consequences for the least common subsumer

Journal of Artificial Intelligence Research
Computing least common subsumers in description logics with existential restrictions

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Computing least common subsumers in ALEN

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

On the Problem of Computing Small Representations of Least Common Subsumers

KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Bibliography

The description logic handbook
Modality conflicts in semantics aware access control

ICWE '06 Proceedings of the 6th international conference on Web engineering
EL description logics with aggregation of user preference concepts

Proceedings of the 2007 conference on Information Modelling and Knowledge Bases XVIII
A Description Logic with Concept Instance Ordering and Top-k Restriction

Proceedings of the 2009 conference on Information Modelling and Knowledge Bases XX
Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Tractable feature generation through description logics with value and number restrictions

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

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.