Stage-oe-small.jpg

Article1066: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
K (Added from ontology)
Zeile 2: Zeile 2:
 
|Rank=1
 
|Rank=1
 
|Author=Boris Motik
 
|Author=Boris Motik
 +
}}
 +
{{Publikation Author
 +
|Rank=3
 +
|Author=Rudi Studer
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
 
|Rank=2
 
|Rank=2
 
|Author=Ulrike Sattler
 
|Author=Ulrike Sattler
}}
 
{{Publikation Author
 
|Rank=3
 
|Author=Rudi Studer
 
 
}}
 
}}
 
{{Article
 
{{Article
Zeile 25: Zeile 25:
 
|Abstract=Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in the rule body. We discuss the expressive power of such a combination and present an algorithm for query answering in the related logic SHIQ extended with DL-safe rules, based on a reduction to disjunctive programs.
 
|Abstract=Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in the rule body. We discuss the expressive power of such a combination and present an algorithm for query answering in the related logic SHIQ extended with DL-safe rules, based on a reduction to disjunctive programs.
 
|VG Wort-Seiten=
 
|VG Wort-Seiten=
|Forschungsgebiet=
 
 
|Projekt=
 
|Projekt=
 
|Forschungsgruppe=
 
|Forschungsgruppe=
 
}}
 
}}

Version vom 15. August 2009, 16:58 Uhr


Query Answering for OWL-DL with Rules


Query Answering for OWL-DL with Rules



Veröffentlicht: 2005 Juli

Journal: Journal of Web Semantics: Science, Services and Agents on the World Wide Web
Nummer: 1
Seiten: 41--60

Volume: 3


Referierte Veröffentlichung

BibTeX




Kurzfassung
Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in the rule body. We discuss the expressive power of such a combination and present an algorithm for query answering in the related logic SHIQ extended with DL-safe rules, based on a reduction to disjunctive programs.



Forschungsgebiet