Stage-oe-small.jpg

Techreport1752: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
 
K (Wikipedia python library)
 
(4 dazwischenliegende Versionen von 2 Benutzern werden nicht angezeigt)
Zeile 1: Zeile 1:
{{Publikation Author
+
{{Publikation Erster Autor
|Rank=1
+
|ErsterAutorNachname=Krötzsch
|Author=Markus Krötzsch
+
|ErsterAutorVorname=Markus
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
Zeile 16: Zeile 16:
 
|Month=April
 
|Month=April
 
|Institution=Institut AIFB, Universität Karlsruhe (TH)
 
|Institution=Institut AIFB, Universität Karlsruhe (TH)
|ID Number=1752
+
|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=
|Download=2008_1752_Krötzsch_ELP: Tractable _1.pdf
+
|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=
|Forschungsgebiet=Deduktive Datenbanken, Beschreibungslogik, Semantic Web, Logik, Komplexitätstheorie, Logikprogrammierung,
+
|Projekt=NeOn, Active, ReaSem,  
|Projekt=ReaSem, NeOn, Active,
+
|Forschungsgruppe=Wissensmanagement
|Forschungsgruppe=
+
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Logikprogrammierung
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Beschreibungslogik
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Komplexitätstheorie
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Deduktive Datenbanken
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Logik
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Semantic Web
 
}}
 
}}

Aktuelle Version vom 16. Oktober 2009, 22:48 Uhr


ELP: Tractable Rules for OWL 2




Published: 2008 April
Institution: Institut AIFB, Universität Karlsruhe (TH)
Archivierungsnummer: 1752

BibTeX



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: LinkLink

Projekt

NeOnActiveReaSem



Forschungsgruppe

Wissensmanagement


Forschungsgebiet

Beschreibungslogik, Deduktive Datenbanken, Komplexitätstheorie, Logik, Logikprogrammierung, Semantic Web