Conjunctive Queries for a Tractable Fragment of OWL 1.1

Presented at: 6th International and 2nd Asian Semantic Web Conference (ISWC2007+ASWC2007)

by Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler

Webpage: http://iswc2007.semanticweb.org/papers/309.pdf

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.

Conjunctive Queries for a Tractable Fragment of OWL 1.1 was presented at this event.

Keywords: Formal language, Reasoning, Semantic Web


Resource URI on the dog food server: http://data.semanticweb.org/conference/iswc-aswc/2007/tracks/research/papers/309
Same as: http://iswc2007.semanticweb.org/papers/309.pdf
Same as: http://revyu.com/things/iswc-aswc-2007-research-paper-309-conjunctive-queries


Explore this resource elsewhere: