Stage-oe-small.jpg

Techreport1724: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
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
}}
 
{{Publikation Author
 
|Rank=3
 
|Author=Pascal Hitzler
 
 
}}
 
}}
 
{{Techreport
 
{{Techreport
Zeile 16: Zeile 16:
 
|Month=Februar
 
|Month=Februar
 
|Institution=Universität Karlsruhe (TH)
 
|Institution=Universität Karlsruhe (TH)
|ID Number=1724
+
|Archivierungsnummer=1724
 
}}
 
}}
 
{{Publikation Details
 
{{Publikation Details
 
|Abstract=We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ - the basis for the ongoing standardisation of OWL 1.1 - can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ is highly intractable, it turns out that DL rules can be introduced to various lightweight DLs without increasing their worst-case complexity. In particular, DL rules enable us to significantly extend the tractable DLs EL++ and DLP.
 
|Abstract=We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ - the basis for the ongoing standardisation of OWL 1.1 - can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ is highly intractable, it turns out that DL rules can be introduced to various lightweight DLs without increasing their worst-case complexity. In particular, DL rules enable us to significantly extend the tractable DLs EL++ and DLP.
 
|VG Wort-Seiten=
 
|VG Wort-Seiten=
|Download=2008_1724_Krötzsch_Expressive_Trac_1.pdf
+
|Link=http://korrekt.org/page/Expressive_Tractable_Description_Logics_based_on_SROIQ_Rules, http://korrekt.org/papers/KroetzschRudolphHitzler_SROIQ-Rules_TR_2008.pdf, http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1760
|Link=http://korrekt.org/page/Expressive_Tractable_Description_Logics_based_on_SROIQ_Rules, http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1760
 
 
|DOI Name=
 
|DOI Name=
 
|Projekt=NeOn, Active, ReaSem,  
 
|Projekt=NeOn, Active, ReaSem,  
|Forschungsgruppe=
+
|Forschungsgruppe=Wissensmanagement
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Logik
+
|Forschungsgebiet=Logikprogrammierung
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Logikprogrammierung
+
|Forschungsgebiet=Beschreibungslogik
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation
+
|Forschungsgebiet=Wissensrepräsentationssprachen
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentationssprachen
+
|Forschungsgebiet=Komplexitätstheorie
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Semantic Web
+
|Forschungsgebiet=Wissensrepräsentation
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogik
+
|Forschungsgebiet=Logik
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Komplexitätstheorie
+
|Forschungsgebiet=Semantic Web
 
}}
 
}}

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


Expressive Tractable Description Logics based on SROIQ Rules




Published: 2008 Februar
Institution: Universität Karlsruhe (TH)
Archivierungsnummer: 1724

BibTeX



Kurzfassung
We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ - the basis for the ongoing standardisation of OWL 1.1 - can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ is highly intractable, it turns out that DL rules can be introduced to various lightweight DLs without increasing their worst-case complexity. In particular, DL rules enable us to significantly extend the tractable DLs EL++ and DLP.

Weitere Informationen unter: LinkLinkLink

Projekt

NeOnActiveReaSem



Forschungsgruppe

Wissensmanagement


Forschungsgebiet

Wissensrepräsentation, Wissensrepräsentationssprachen, Beschreibungslogik, Komplexitätstheorie, Logik, Logikprogrammierung, Semantic Web