Stage-oe-small.jpg

Inproceedings3025: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
Zeile 24: Zeile 24:
 
In this paper, we present a polynomial and modular translation from Horn-SHOIQ knowledge bases into Datalog, which shows that standard reasoning tasks are feasible in deterministic single exponential time. This improves over the previously known upper bounds, and contrasts the known NExpTime completeness of full SHOIQ. Thereby Horn-SHOIQ stands out as the first ExpTime-complete DL that allows simultaneously for O, I, and Q. In addition, we show that standard reasoning in Horn-SROIQ is 2ExpTime-complete.
 
In this paper, we present a polynomial and modular translation from Horn-SHOIQ knowledge bases into Datalog, which shows that standard reasoning tasks are feasible in deterministic single exponential time. This improves over the previously known upper bounds, and contrasts the known NExpTime completeness of full SHOIQ. Thereby Horn-SHOIQ stands out as the first ExpTime-complete DL that allows simultaneously for O, I, and Q. In addition, we show that standard reasoning in Horn-SROIQ is 2ExpTime-complete.
 
Despite their high expressiveness, both Horn-SHOIQ and Horn-SROIQ have polynomial data complexity. This makes them particularly attractive for reasoning in semantically enriched systems with large data sets. A promising first step in this direction could be achieved exploiting existing Datalog engines, along the lines of our translation.
 
Despite their high expressiveness, both Horn-SHOIQ and Horn-SROIQ have polynomial data complexity. This makes them particularly attractive for reasoning in semantically enriched systems with large data sets. A promising first step in this direction could be achieved exploiting existing Datalog engines, along the lines of our translation.
|Download=Main.pdf,  
+
|Download=ORS-HornOWL.pdf,  
 
|Projekt=ExpresST, ReaSem
 
|Projekt=ExpresST, ReaSem
 
|Forschungsgruppe=Wissensmanagement
 
|Forschungsgruppe=Wissensmanagement

Version vom 20. Februar 2010, 16:49 Uhr


Worst-case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2


Worst-case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2



Published: 2010 Mai

Buchtitel: Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference
Verlag: AAAI Press

Referierte VeröffentlichungNote: to appear

BibTeX

Kurzfassung
Horn fragments of Description Logics (DLs) are popular due to their beneficial trade-off between expressive power and computational complexity. Despite their potential, and partly due to the intricate interaction of nominals (O), inverses (I) and counting (Q), such fragments had not been studied so far for the DLs SHOIQ and SROIQ that underly OWL 1 and 2. In this paper, we present a polynomial and modular translation from Horn-SHOIQ knowledge bases into Datalog, which shows that standard reasoning tasks are feasible in deterministic single exponential time. This improves over the previously known upper bounds, and contrasts the known NExpTime completeness of full SHOIQ. Thereby Horn-SHOIQ stands out as the first ExpTime-complete DL that allows simultaneously for O, I, and Q. In addition, we show that standard reasoning in Horn-SROIQ is 2ExpTime-complete. Despite their high expressiveness, both Horn-SHOIQ and Horn-SROIQ have polynomial data complexity. This makes them particularly attractive for reasoning in semantically enriched systems with large data sets. A promising first step in this direction could be achieved exploiting existing Datalog engines, along the lines of our translation.

Download: Media:ORS-HornOWL.pdf

Projekt

ExpresSTReaSem



Forschungsgruppe

Wissensmanagement


Forschungsgebiet

Beschreibungslogik, Komplexitätstheorie, Logik, Logikprogrammierung