Techreport1752: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Wikipedia python library) |
||
| (2 dazwischenliegende Versionen von 2 Benutzern werden nicht angezeigt) | |||
| Zeile 2: | Zeile 2: | ||
|ErsterAutorNachname=Krötzsch | |ErsterAutorNachname=Krötzsch | ||
|ErsterAutorVorname=Markus | |ErsterAutorVorname=Markus | ||
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=Pascal Hitzler | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
|Author=Sebastian Rudolph | |Author=Sebastian Rudolph | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Techreport | {{Techreport | ||
| Zeile 16: | Zeile 16: | ||
|Month=April | |Month=April | ||
|Institution=Institut AIFB, Universität Karlsruhe (TH) | |Institution=Institut AIFB, Universität Karlsruhe (TH) | ||
| − | | | + | |Archivierungsnummer=1752 |
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|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= | ||
| − | + | |Link=http://korrekt.org/page/ELP:_Tractable_Rules_for_OWL_2, http://korrekt.org/papers/KroetzschRudolphHitzler_ELP_TR_2008.pdf | |
| − | |Link=http://korrekt.org/page/ELP:_Tractable_Rules_for_OWL_2 | ||
|DOI Name= | |DOI Name= | ||
|Projekt=NeOn, Active, ReaSem, | |Projekt=NeOn, Active, ReaSem, | ||
| − | |Forschungsgruppe= | + | |Forschungsgruppe=Wissensmanagement |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Logikprogrammierung |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Beschreibungslogik |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Komplexitätstheorie |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Deduktive Datenbanken |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Logik |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Semantic Web |
}} | }} | ||
Aktuelle Version vom 16. Oktober 2009, 22:48 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.
Weitere Informationen unter: Link, Link
Beschreibungslogik, Deduktive Datenbanken, Komplexitätstheorie, Logik, Logikprogrammierung, Semantic Web