LATPub499: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| (Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt) | |||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Unification in Description Logics (DLs) has been proposed as an inference | |Abstract=Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. The inexpressive Description Logic EL is of particular interest in this context since, on the one hand, several large biomedical ontologies are defined using EL. On the other hand, unification in EL has recently been shown to be NP-complete, and thus of significantly lower complexity than unification in other DLs of similarly restricted expressive power. However, the unification algorithms for EL developed so far cannot deal with general concept inclusion axioms (GCIs). This paper makes a considerable step towards addressing this problem, but the GCIs our new unification algorithm can deal with still need to satisfy a certain cycle restriction. | ||
service that can, for example, be used to detect redundancies in ontologies. | |||
The inexpressive Description Logic EL is of particular | |||
interest in this context since, on the one hand, several large biomedical | |||
ontologies are defined using EL. On the other hand, unification | |||
in EL has recently been shown to be NP-complete, and thus | |||
of significantly lower complexity than unification in other DLs of similarly | |||
restricted expressive power. However, the unification algorithms for EL developed | |||
so far cannot deal with general concept inclusion axioms (GCIs). This paper | |||
makes a considerable step towards addressing this problem, but the GCIs our new | |||
unification algorithm can deal with still need to satisfy a certain cycle restriction. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 50: | Zeile 38: | ||
year = {2012}, | year = {2012}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Extending Unification in EL Towards General TBoxes
Franz BaaderFranz Baader, Stefan BorgwardtStefan Borgwardt, Barbara MorawskaBarbara Morawska
Franz Baader, Stefan Borgwardt, Barbara Morawska
Extending Unification in EL Towards General TBoxes
In Gerhard Brewka and Thomas Eiter and Sheila A. McIlraith, eds., Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR'12), 568-572, 2012. AAAI Press
Extending Unification in EL Towards General TBoxes
In Gerhard Brewka and Thomas Eiter and Sheila A. McIlraith, eds., Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR'12), 568-572, 2012. AAAI Press
- KurzfassungAbstract
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. The inexpressive Description Logic EL is of particular interest in this context since, on the one hand, several large biomedical ontologies are defined using EL. On the other hand, unification in EL has recently been shown to be NP-complete, and thus of significantly lower complexity than unification in other DLs of similarly restricted expressive power. However, the unification algorithms for EL developed so far cannot deal with general concept inclusion axioms (GCIs). This paper makes a considerable step towards addressing this problem, but the GCIs our new unification algorithm can deal with still need to satisfy a certain cycle restriction. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BaBM-KR12,
author = {Franz {Baader} and Stefan {Borgwardt} and Barbara {Morawska}},
booktitle = {Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning ({KR'12})},
editor = {Gerhard {Brewka} and Thomas {Eiter} and Sheila A. {McIlraith}},
pages = {568--572},
publisher = {AAAI Press},
title = {Extending Unification in {$\mathcal{EL}$} Towards General {TBoxes}},
year = {2012},
}
