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 of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted is undecidable. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Krötzsch, M., Rudolph, S., & Hitzler, P. (2007). Conjunctive queries for a tractable fragment of OWL 1.1. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4825 LNCS, pp. 310–323). https://doi.org/10.1007/978-3-540-76298-0_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
