Techreport1752: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 1: | Zeile 1: | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=Pascal Hitzler | ||
| + | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=1 | |Rank=1 | ||
|Author=Markus Krötzsch | |Author=Markus Krötzsch | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 21: | Zeile 21: | ||
|Abstract=We introduce ELP as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. ELP is based on the tractable description logic EL++, and encompasses an extended notion of the recently proposed DL rules for that logic. Thus ELP extends EL++ with a number of features introduced by the forthcoming OWL 2, such as disjoint roles, local reflexivity, certain range restrictions, and the universal role. We present a reasoning algorithm based on a translation of ELP to Datalog, and this translation also enables the seamless integration of DL-safe rules into ELP. While reasoning with DL-safe rules as such is already highly intractable, we show that DL-safe rules based on the Description Logic Programming (DLP) fragment of OWL 2 can be admitted in ELP without losing tractability. | |Abstract=We introduce ELP as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. ELP is based on the tractable description logic EL++, and encompasses an extended notion of the recently proposed DL rules for that logic. Thus ELP extends EL++ with a number of features introduced by the forthcoming OWL 2, such as disjoint roles, local reflexivity, certain range restrictions, and the universal role. We present a reasoning algorithm based on a translation of ELP to Datalog, and this translation also enables the seamless integration of DL-safe rules into ELP. While reasoning with DL-safe rules as such is already highly intractable, we show that DL-safe rules based on the Description Logic Programming (DLP) fragment of OWL 2 can be admitted in ELP without losing tractability. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
| − | |Download= | + | |Download=2008_1752_Krötzsch_ELP_Tractable__1.pdf |
|Link=http://korrekt.org/page/ELP:_Tractable_Rules_for_OWL_2 | |Link=http://korrekt.org/page/ELP:_Tractable_Rules_for_OWL_2 | ||
|DOI Name= | |DOI Name= | ||
| − | |||
|Projekt=ReaSem, NeOn, Active, | |Projekt=ReaSem, NeOn, Active, | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Komplexitätstheorie | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Semantic Web | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Logikprogrammierung | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Logik | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Deduktive Datenbanken | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Beschreibungslogik | ||
}} | }} | ||
Version vom 15. August 2009, 16:23 Uhr
Published: 2008
April
Institution: Institut AIFB, Universität Karlsruhe (TH)
Archivierungsnummer:1752
Kurzfassung
We introduce ELP as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. ELP is based on the tractable description logic EL++, and encompasses an extended notion of the recently proposed DL rules for that logic. Thus ELP extends EL++ with a number of features introduced by the forthcoming OWL 2, such as disjoint roles, local reflexivity, certain range restrictions, and the universal role. We present a reasoning algorithm based on a translation of ELP to Datalog, and this translation also enables the seamless integration of DL-safe rules into ELP. While reasoning with DL-safe rules as such is already highly intractable, we show that DL-safe rules based on the Description Logic Programming (DLP) fragment of OWL 2 can be admitted in ELP without losing tractability.
Download: Media:2008_1752_Krötzsch_ELP_Tractable__1.pdf
Weitere Informationen unter: Link
Beschreibungslogik, Deduktive Datenbanken, Komplexitätstheorie, Logik, Logikprogrammierung, Semantic Web