# Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes

Franz Baader, Stefan Borgwardt, Barbara Morawska
Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, volume 11-05, 2011. LTCS-Report
• KurzfassungAbstract
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. The inexpressive Description Logic EL is of particular interest in this context since, on the one hand, several large biomedical ontologies are defined using EL. On the other hand, unification in EL has recently been shown to be NP-complete, and thus of significantly lower complexity than unification in other DLs of similarly restricted expressive power. However, the unification algorithms for EL developed so far cannot deal with general concept inclusion axioms (GCIs). This paper makes a considerable step towards addressing this problem, but the GCIs our new unification algorithm can deal with still need to satisfy a certain cycle restriction.
• Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
• Forschungsgruppe:Research Group: Automatentheorie
@techreport{ BaBM-LTCS-11-05,
title = {Unification in the Description Logic {$\mathcal{EL}$} w.r.t.\ Cycle-Restricted {TB}oxes},