# Computing Minimal EL-Unifiers is Hard

Franz Baader, Stefan Borgwardt, Barbara Morawska
Computing Minimal EL-Unifiers is Hard
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, volume 12-03, 2012. LTCS-Report
• KurzfassungAbstract
Unification has been investigated both in modal logics and in description logics, albeit with different motivations. In description logics, unification can be used to detect redundancies in ontologies. In this context, it is not sufficient to decide unifiability, one must also compute appropriate unifiers and present them to the user. For the description logic EL, which is used to define several large biomedical ontologies, deciding unifiability is an NP-complete problem. It is known that every solvable EL-unification problem has a minimal unifier, and that every minimal unifier is a local unifier. Existing unification algorithms for EL compute all minimal unifiers, but additionally (all or some) non-minimal local unifiers. Computing only the minimal unifiers would be better since there are considerably less minimal unifiers than local ones, and their size is usually also quite small. In this paper we investigate the question whether the known algorithms for EL-unification can be modified such that they compute exactly the minimal unifiers without changing the complexity and the basic nature of the algorithms. Basically, the answer we give to this question is negative.
• Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
• Forschungsgruppe:Research Group: Automatentheorie
@techreport{ BaBM-LTCS-12-03,
title = {Computing Minimal {$\mathcal{EL}$}-Unifiers is Hard},