DMCA
Unification in the Description Logic EL
Cached
Download Links
by
Franz Baader
,
Barbara Morawska
| Citations: | 30 - 20 self |
BibTeX
@MISC{Baader_unificationin,
author = {Franz Baader and Barbara Morawska},
title = {Unification in the Description Logic EL},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies. Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. The main result of this paper is that unification in EL is decidable. More precisely, we show that EL-unification is NP-complete, and thus has the same complexity as EL-matching. 1
