DMCA
Hybrid Unification in the Description Logic EL
BibTeX
@MISC{Baader_hybridunification,
author = {Franz Baader and Oliver Fernández Gil and Barbara Morawska},
title = {Hybrid Unification in the Description Logic EL},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundan-cies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. However, the unifi-cation algorithms for EL developed until recently could not deal with ontologies containing general concept inclusions (GCIs). In a series of re-cent papers we have made some progress towards addressing this prob-lem, but the ontologies the developed 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 fixpoint and descriptive semantics. We show that hybrid unification in EL is NP-complete and introduce a goal-oriented algorithm for computing hybrid unifiers. 1
Keyphrases
hybrid unification description logic el hybrid unifiers re-cent paper acyclic tboxes different approach description logic hybrid semantics several large biomedical ontology unifi-cation algorithm general concept inclusion certain cycle restriction input ontology developed unification algorithm cyclic tboxes inference service combine fixpoint whereas classical unifiers goal-oriented algorithm dl el descriptive semantics so-called hybrid unifiers present paper
