LATPub496: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| Zeile 6: | Zeile 6: | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=1 | |Referiert=1 | ||
|Title=UEL: Unification Solver for the Description Logic EL | |Title=UEL: Unification Solver for the Description Logic EL – System Description | ||
|Year=2012 | |Year=2012 | ||
|Month= | |Month= | ||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=UEL is a system that computes unifiers for unification problems formulated | |Abstract=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 used as a plug-in of the popular ontology editor Protege, or as a standalone unification application. | ||
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 | |||
as a plug-in of the popular ontology editor Protege, or as a standalone | |||
unification application. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 49: | Zeile 40: | ||
year = {2012}, | year = {2012}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 13:24 Uhr
UEL: Unification Solver for the Description Logic EL – System Description
Franz BaaderFranz Baader, Julian MendezJulian Mendez, Barbara MorawskaBarbara Morawska
Franz Baader, Julian Mendez, Barbara Morawska
UEL: Unification Solver for the Description Logic EL – System Description
Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12), volume 7364 of Lecture Notes in Artificial Intelligence, 45-51, 2012. Springer
UEL: Unification Solver for the Description Logic EL – System Description
Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12), volume 7364 of Lecture Notes in Artificial Intelligence, 45-51, 2012. Springer
- 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 can be used as a plug-in of the popular ontology editor Protege, or as a standalone unification application. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BaMM-IJCAR-12,
address = {Manchester, UK},
author = {Franz {Baader} and Julian {Mendez} and Barbara {Morawska}},
booktitle = {Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12)},
pages = {45--51},
publisher = {Springer-Verlag},
series = {Lecture Notes in Artificial Intelligence},
title = {UEL: Unification Solver for the Description Logic EL -- System Description},
volume = {7364},
year = {2012},
}
