A practical approach for computing generalization inferences in EL

Authors:
Rafael Peñaloza;Anni-Yasmin Turhan
Affiliations:
TU Dresden, Germany;TU Dresden, Germany
Venue:
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Year:
2011

Citing 11
Cited 1

Approximating most specific concepts in description logics with existential restrictions

AI Communications - Special issue on KI-2001
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Partial and Informative Common Subsumers in Description Logics

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Computing least common subsumers in description logics with existential restrictions

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Using information content to evaluate semantic similarity in a taxonomy

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Terminological cycles in a description logic with existential restrictions

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Employing description logics in Ambient Intelligence for modeling and reasoning about complex situations

Journal of Ambient Intelligence and Smart Environments
Enriching EL-Concepts with Greatest Fixpoints

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Computing least common subsumers in description logics

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
CEL: a polynomial-time reasoner for life science ontologies

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

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

We present methods that compute generalizations of concepts or individuals described in ontologies written in the Description Logic EL. These generalizations are the basis of methods for ontology design and are the core of concept similarity measures. The reasoning service least common subsumer (lcs) generalizes a set of concepts. Similarly, the most specific concept (msc) generalizes an individual into a concept description. For EL with general EL-TBoxes, the lcs and the msc may not exist. However, it is possible to find a concept description that is the lcs (msc) up to a certain role-depth. In this paper we present a practical approach for computing the lcs and msc with a bounded depth, based on the polynomial-time completion algorithm for EL and describe its implementation.