UEL: Unification Solver for EL

Franz BaaderFranz Baader,  Stefan BorgwardtStefan Borgwardt,  Julian Alfredo MendezJulian Alfredo Mendez,  Barbara MorawskaBarbara Morawska
Franz Baader, Stefan Borgwardt, Julian Alfredo Mendez, Barbara Morawska
UEL: Unification Solver for EL
In Yevgeny Kazakov and Domenico Lembo and Frank Wolter, eds., Proceedings of the 25th International Workshop on Description Logics (DL'12), volume 846 of CEUR Workshop Proceedings, 26-36, 2012
• KurzfassungAbstract
UEL is a system that computes unifiers for unification problems formulated in the description logic EL. EL is a description logic with restricted expressivity, but which is still expressive enough for the formal representation of biomedical ontologies, such as the large medical ontology SNOMED CT. We propose to use UEL as a tool to detect redundancies in such ontologies by computing unifiers of two formal concepts suspected of expressing the same concept of the application domain. UEL provides access to two different unification algorithms and can be used as a plug-in of the popular ontology editor Protégé, or stand-alone.
• Forschungsgruppe:Research Group: Automatentheorie
@inproceedings{ BBMM-DL-12,
address = {Rome, Italy},
author = {Franz {Baader} and Stefan {Borgwardt} and Julian Alfredo {Mendez} and Barbara {Morawska}},
booktitle = {Proceedings of the 25th International Workshop on Description Logics (DL'12)},
editor = {Yevgeny {Kazakov} and Domenico {Lembo} and Frank {Wolter}},
pages = {26--36},
series = {CEUR Workshop Proceedings},
title = {{UEL}: Unification Solver for {$\mathcal{EL}$}},
volume = {846},
year = {2012},
}