Stage-oe-small.jpg

Techreport1753: 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 Erster Autor
 +
|ErsterAutorNachname=Rudolph
 +
|ErsterAutorVorname=Sebastian
 +
}}
 
{{Publikation Author
 
{{Publikation Author
 
|Rank=2
 
|Rank=2
 
|Author=Markus Krötzsch
 
|Author=Markus Krötzsch
}}
 
{{Publikation Author
 
|Rank=1
 
|Author=Sebastian Rudolph
 
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
Zeile 16: Zeile 16:
 
|Month=April
 
|Month=April
 
|Institution=Institut AIFB, Universität Karlsruhe
 
|Institution=Institut AIFB, Universität Karlsruhe
|ID Number=1753
+
|Archivierungsnummer=1753
 
}}
 
}}
 
{{Publikation Details
 
{{Publikation Details
 
|Abstract=We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today's most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs SHOIQ and SROIQ, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The prominent OWL-fragment SHIQ can be safely extended by safe role expressions, and the tractable fragments EL++ and DLP retain tractability if extended by conjunction on roles, where in the case of DLP the restriction on role simplicity can even be discarded.
 
|Abstract=We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today's most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs SHOIQ and SROIQ, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The prominent OWL-fragment SHIQ can be safely extended by safe role expressions, and the tractable fragments EL++ and DLP retain tractability if extended by conjunction on roles, where in the case of DLP the restriction on role simplicity can even be discarded.
 
|VG Wort-Seiten=
 
|VG Wort-Seiten=
|Download=2008_1753_Rudolph_Cheap Boolean R_1.pdf, 2008_1753_Rudolph_Cheap Boolean R_2.pdf
+
|Download=2008_1753_Rudolph_Cheap_Boolean_R_1.pdf, 2008_1753_Rudolph_Cheap_Boolean_R_2.pdf
 
|DOI Name=
 
|DOI Name=
|Forschungsgebiet=Wissensrepräsentationssprachen, Beschreibungslogik, Wissensrepräsentation, Logik,
+
|Projekt=NeOn, Active, ReaSem,  
|Projekt=ReaSem, NeOn, Active,
+
|Forschungsgruppe=Wissensmanagement
|Forschungsgruppe=
+
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Logik
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Wissensrepräsentation
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Wissensrepräsentationssprachen
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Beschreibungslogik
 
}}
 
}}

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


Cheap Boolean Role Constructors for Description Logics




Published: 2008 April
Institution: Institut AIFB, Universität Karlsruhe
Archivierungsnummer: 1753

BibTeX



Kurzfassung
We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today's most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs SHOIQ and SROIQ, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The prominent OWL-fragment SHIQ can be safely extended by safe role expressions, and the tractable fragments EL++ and DLP retain tractability if extended by conjunction on roles, where in the case of DLP the restriction on role simplicity can even be discarded.

Download: Media:2008_1753_Rudolph_Cheap_Boolean_R_1.pdf,Media:2008_1753_Rudolph_Cheap_Boolean_R_2.pdf

Projekt

NeOnActiveReaSem



Forschungsgruppe

Wissensmanagement


Forschungsgebiet

Wissensrepräsentation, Wissensrepräsentationssprachen, Beschreibungslogik, Logik