Approximating most specific concepts in description logics with existential restrictions

Authors:
Ralf Küsters;Ralf Molitor
Affiliations:
Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;IT Research and Development Group, Swiss Life, Zurich, Switzerland
Venue:
AI Communications - Special issue on KI-2001
Year:
2002

Citing 9
Cited 5

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 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
What's in an attribute? consequences for the least common subsumer

Journal of Artificial Intelligence Research
Computing least common subsumers in ALEN

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

Prime implicates and prime implicants: from propositional to modal logic

Journal of Artificial Intelligence Research
A practical approach for computing generalization inferences in EL

ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Tractable set constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Tractable set constraints

Journal of Artificial Intelligence Research
Most specific generalizations w.r.t. general EL-TBoxes

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

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.