A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
UEL: Unification Solver for the Description Logic $\mathcal{EL}$ – System Description
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
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 can be
doi:10.1007/978-3-642-31365-3_6
fatcat:v574y6sbmve6pml6gh4witnjdq