Document Type
Conference Proceeding
Publication Date
11-1-2007
Abstract
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.
Repository Citation
Krotzsch, M.,
Rudolph, S.,
& Hitzler, P.
(2007). Conjunctive Queries for a Tractable Fragment of OWL 1.1. Lecture Notes in Computer Science, 4825, 310-323.
https://corescholar.libraries.wright.edu/cse/141
DOI
10.1007/978-3-540-76298-0_23
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
Presented at the 6th International Semantic Web Conference, Busan, Korea, November 11-15, 2007.
Attached is the unpublished, authors' version of this proceeding. The final, publisher's version can be found at http://dx.doi.org/10.1007/978-3-540-76298-0_23.