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 \(\mathcal{EL}^{\mathord{+}\mathord{+}}\) of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted \(\mathcal{EL}^{\mathord{+}\mathord{+}}\) is undecidable.
This work has been supported by the European Commission under contract IST-2006-027595 NeOn, and by the Deutsche Forschungsgemeinschaft (DFG) under the ReaSem project.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Hopcroft, J.E., Friedman, E.P., Harrison, M.A. (eds.) STOC 1977. Proc. 9th annual ACM Symposium on Theory of Computing, pp. 77–90. ACM Press, New York (1977)
Horrocks, I., Sattler, U., Tessaris, S., Tobies, S.: How to decide query containment under constraints using a description logic. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 326–343. Springer, Heidelberg (2000)
Hustadt, U., Motik, B., Sattler, U.: A decomposition rule for decision procedures by resolution-based calculi. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 21–35. Springer, Heidelberg (2005)
Ortiz, M.M., Calvanese, D., Eiter, T.: Data complexity of answering unions of conjunctive queries in SHIQ. In: Proc. 2006 Description LogicWorkshop (DL 2006), CEUR Electronic Workshop Proceedings (2006), http://ceur-ws.org/
Ortiz, M.M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: AAAI 2006. Proc. 21st Nat. Conf. on Artificial Intelligence (2006)
Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic SHIQ. In: IJCAI 2007. Proc. 21st Int. Joint Conf. on Artificial Intelligence, Hyderabad, India (2007), available at http://www.ijcai.org/papers07/contents.php
Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: IJCAI 2005. Proc. 19th Int. Joint Conf. on Artificial Intelligence, Morgan-Kaufmann Publishers, Edinburgh, UK (2005)
Krisnadhi, A., Lutz, C.: Data complexity in the EL family of DLs. In: Proc. DL 2007. CEUR Electronic Workshop Proceedings (2007)
Horrocks, I., Sattler, U.: Decidability of SHIQ with complex role inclusion axioms. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003. Proc. 18th Int. Joint Conf. on Artificial Intelligence, Acapulco, Mexico, pp. 343–348. Morgan-Kaufmann Publishers, San Francisco (2003)
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: KR 2006. Proc. 10th Int. Conf. on Principles of Knowledge Representation and Reasoning, pp. 57–67. AAAI Press, Stanford, California, USA (2006)
11. Krötzsch, M., Rudolph, S.: Conjunctive queries for EL with role composition. Technical report, Universität Karlsruhe (TH), Germany (2007), available at http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1463
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: KR 2006. Proc. 10th Int. Conf. on Principles of Knowledge Representation and Reasoning, pp. 260–270 (2006)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33, 374–425 (2001)
Kozen, D.: Lower bounds for natural proof systems. In: Proc. 18th Symp. on the Foundations of Computer Science, pp. 254–266 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krötzsch, M., Rudolph, S., Hitzler, P. (2007). Conjunctive Queries for a Tractable Fragment of OWL 1.1. In: Aberer, K., et al. The Semantic Web. ISWC ASWC 2007 2007. Lecture Notes in Computer Science, vol 4825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76298-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-76298-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76297-3
Online ISBN: 978-3-540-76298-0
eBook Packages: Computer ScienceComputer Science (R0)