Reasoning and revision in hybrid representation systems
Reasoning and revision in hybrid representation systems
Unification of concept terms in description logics
Journal of Symbolic Computation
The description logic handbook
Unification in the Description Logic $\mathcal{EL}$
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
SAT encoding of unification in EL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
| Hi-index | 0.00 |
UEL is a system that computes unifiers for unification problems formulated in the description logic $\mathcal{EL}$. $\mathcal{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 can be used as a plug-in of the popular ontology editor Protégé, or as a standalone unification application.