Most specific generalizations w.r.t. general EL-TBoxes

Authors:
Benjamin Zarrieß;Anni-Yasmin Turhan
Affiliations:
Institute for Theoretical Computer Science, Technische Universität Dresden, Germany;Institute for Theoretical Computer Science, Technische Universität Dresden, Germany
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 10
Cited 0

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
NCI Thesaurus: A semantic model integrating cancer-related clinical and molecular information

Journal of Biomedical Informatics
Computing least common subsumers in description logics with existential restrictions

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
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
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Deciding inseparability and conservative extensions in the description logic EL

Journal of Symbolic Computation
Enriching EL-Concepts with Greatest Fixpoints

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
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
A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic EL

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general EL-TBox neither the lcs nor the msc need to exist. So far in this setting no exact conditions for the existence of lcs-or msc-concepts are known. This paper provides necessary and sufficient conditions for the existence of these two kinds of concepts. For the lcs of a fixed number of concepts and the msc we show decidability of the existence in PTime and polynomial bounds on the maximal role-depth of the lcs-and msc-concepts. This bound allows to compute the lcs and the msc, respectively.