DMCA
Hybrid Unification in the Description Logic EL (2013)
BibTeX
@MISC{Dresden13hybridunification,
author = {Technische Universität Dresden and Franz Baader and Oliver Fernández and Gil Barbara Morawska and Lehrstuhl Für Automatentheorie and Tu Dresden and Nöthnitzer Str and Franz Baader and Oliver Fernández Gil},
title = {Hybrid Unification in the Description Logic EL},
year = {2013}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Unification in Description Logics (DLs) has been proposed as an in-ference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. However, the unification algorithms for EL developed until recently could not deal with ontologies containing general concept inclusions (GCIs). In a series of recent papers we have made some progress towards addressing this problem, but the ontologies the de-veloped unification algorithms can deal with need to satisfy a certain cycle restriction. In the present paper, we follow a different approach. Instead of restricting the input ontologies, we generalize the notion of unifiers to so-called hybrid unifiers. Whereas classical unifiers can be viewed as acyclic TBoxes, hybrid unifiers are cyclic TBoxes, which are interpreted together with the ontology of the input using a hybrid semantics that combines fix-point and descriptive semantics. We show that hybrid unification in EL is NP-complete and introduce a goal-oriented algorithm for computing hybrid unifiers.
Keyphrases
hybrid unification description logic el hybrid unifiers acyclic tboxes different approach description logic hybrid semantics several large biomedical ontology unification algorithm general concept inclusion certain cycle restriction input ontology cyclic tboxes in-ference service whereas classical unifiers de-veloped unification algorithm goal-oriented algorithm dl el descriptive semantics so-called hybrid unifiers present paper recent paper
