Abstract
We provide an ExpTime algorithm for answering conjunctive queries (CQs) in Horn-\(\mathcal{SHIQ}\), a Horn fragment of the well-known Description Logic \(\mathcal{SHIQ}\) underlying the OWL-Lite standard. The algorithm employs a domino system for model representation, which is constructed via a worst-case optimal tableau algorithm for Horn-\(\mathcal{SHIQ}\); the queries are answered by reasoning over the domino system. Our algorithm not only shows that CQ answering in Horn-\(\mathcal{SHIQ}\) is not harder than satisfiability testing, but also that it is polynomial in data complexity, making Horn-\(\mathcal{SHIQ}\) an attractive expressive Description Logic.
This work was partially supported by the Austrian Science Fund (FWF) grant P20840, Wolfgang Pauli Institute (WPI), and the Mexican National Council for Science and Technology (CONACYT) grant 187697.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
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
Baader, F.: Terminological cycles in a description logic with existential restrictions. In: IJCAI 2003, pp. 325–330 (2003)
Cali, A., Gottlob, G., Kifer, M.: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In: KR 2008 (to appear, 2008)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: KR 2006 (2006)
Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: PODS 1998, pp. 149–158 (1998)
Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning 39(3), 385–429 (2007)
Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive Query Answering for the Description Logic \(\mathcal{SHIQ}\). In: IJCAI 2007, pp. 399–404 (2007)
Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester (1997)
Horrocks, I., Sattler, U.: A tableaux decision procedure for \(\mathcal{SHOIQ}\). In: IJCAI 2005, pp. 448–453 (2005)
Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: IJCAI 2005, pp. 466–471 (2005)
Krisnadhi, A., Lutz, C.: Data complexity in the \(\mathcal{EL}\) family of description logics. In: DL 2007, Bressanone, Italy. CEUR-WS, vol. 250, pp. 88–99 (2007)
Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: AAAI 2007, pp. 452–457 (2007)
Krötzsch, M., Rudolph, S., Hitzler, P.: Conjunctive queries for a tractable fragment of OWL 1.1. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007/ISWC 2007. LNCS, vol. 4825, pp. 310–323. Springer, Heidelberg (2007)
Lutz, C.: Inverse roles make conjunctive queries hard. In: DL 2007 (2007)
Lutz, C.: Two upper bounds for conjunctive query answering in \(\mathcal{SHIQ}\). In: DL 2008 (2008)
Motik, B., Shearer, R., Horrocks, I.: Optimized reasoning in description logics using hypertableaux. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 67–83. Springer, Heidelberg (2007)
Ortiz, M., Šimkus, M., Eiter, T.: Worst-case optimal conjunctive query answering in description logics without inverses. In: AAAI 2008 (to appear, 2008)
Rosati, R.: On conjunctive query answering in \(\mathcal{EL}\). In: DL 2007 (2007)
Rudolph, S., Krötzsch, M., Hitzler, P.: Terminological reasoning in \(\mathcal{SHIQ}\) with ordered binary decision diagrams. In: AAAI 2008 (to appear, 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Gottlob, G., Ortiz, M., Šimkus, M. (2008). Query Answering in the Description Logic Horn-\(\mathcal{SHIQ}\) . In: Hölldobler, S., Lutz, C., Wansing, H. (eds) Logics in Artificial Intelligence. JELIA 2008. Lecture Notes in Computer Science(), vol 5293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87803-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-87803-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87802-5
Online ISBN: 978-3-540-87803-2
eBook Packages: Computer ScienceComputer Science (R0)