Stage-oe-small.jpg

Inproceedings1550: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
K (Wikipedia python library)
 
Zeile 31: Zeile 31:
 
|DOI Name=
 
|DOI Name=
 
|Projekt=ReaSem, NeOn,  
 
|Projekt=ReaSem, NeOn,  
|Forschungsgruppe=
+
|Forschungsgruppe=Wissensmanagement
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl

Aktuelle Version vom 16. Oktober 2009, 23:01 Uhr


Conjunctive Queries for a Tractable Fragment of OWL 1.1


Conjunctive Queries for a Tractable Fragment of OWL 1.1



Published: 2007 November
Herausgeber: Karl Aberer and Key-Sun Choi and Natasha Noy and Dean Allemang and Kyung-Il Lee and Lyndon Nixon and Jennifer Golbeck and Peter Mika and Diana Maynard and Riichiro Mizoguchi and Guus Schreiber and Philippe Cudré-Mauroux
Buchtitel: Proceedings of the 6th International Semantic Web Conference (ISWC 2007)
Ausgabe: 4825
Reihe: LNCS
Seiten: 310--323
Verlag: Springer

Referierte Veröffentlichung

BibTeX

Kurzfassung
Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries -- namely conjunctive ones -- can be used in conjunction with OWL such that one of the major design criteria of the latter -- namely decidability -- can be retained. More precisely, we show that querying the tractable fragment EL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted EL++ is undecidable.

ISBN: 978-3-540-76297
ISSN: 0302-9743
Weitere Informationen unter: LinkLinkLink

Projekt

ReaSemNeOn



Forschungsgruppe

Wissensmanagement


Forschungsgebiet

Wissensrepräsentationssprachen, Beschreibungslogik, Entscheidbarketisprobleme, Komplexitätstheorie, Logik, Semantic Web