Abstract
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for this problem. In this paper, we consider knots, which are an instance of the mosaic technique from Modal Logic. When annotated with suitable query information, knots are a flexible tool for query answering that allows for solving the problem in a simple and intuitive way. The knot approach yields optimal complexity bounds, as we illustrate on the DLs \(\mathcal {ALCH}\) and \(\mathcal{ALCHI}\), and can be easily extended to accommodate other constructs.
This work has been partially supported by the Austrian Science Fund (FWF) grants P20840 and P20841, the EU Project Ontorule (FP7 231875), and the Mexican National Council for Science and Technology (CONACYT) grant 187697.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Lutz, C., Motik, B. (eds.): Proceedings of the 21st International Workshop on Description Logics (DL 2008), Dresden, Germany, May 13-16, 2008. CEUR Workshop Proceedings, vol. 353. CEUR-WS.org (2008)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Sc., vol. 53. Cambridge University Press, Cambridge (2001)
Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: An automata-theoretic approach. In: Proc. of the 22nd Nat. Conf. on Artificial Intelligence (AAAI 2007), pp. 391–396 (2007)
Eiter, T., Gottlob, G., Ortiz, M., Šimkus, M.: Query answering in the description logic Horn-SHIQ. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS, vol. 5293, pp. 166–179. Springer, Heidelberg (2008)
Eiter, T., Lutz, C., Ortiz, M., Šimkus, M.: Query answering in description logics with transitive roles. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009). AAAI Press/IJCAI (2009)
Eiter, T., Ortiz, M., Simkus, M.: Reasoning using knots. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS, vol. 5330, pp. 377–390. Springer, Heidelberg (2008)
Fox, D., Gomes, C.P. (eds.): Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008. AAAI Press, Menlo Park (2008)
Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query entailment for \(\mathcal{SHOQ}\). In: Proc. of the 2007 Description Logic Workshop (DL 2007). CEUR Electronic Workshop Proceedings, vol. 250, pp. 65–75 (2007), http://ceur-ws.org/Vol-250/
Glimm, B., Lutz, C., Horrocks, I., Sattler, U.: Answering conjunctive queries in the \(\mathcal{SHIQ}\) description logic. Journal of Artificial Intelligence Research 31, 150–197 (2008)
Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell. 54(3), 319–379 (1992)
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, vol. 3452, pp. 21–35. Springer, Heidelberg (2005)
Lutz, C.: The complexity of conjunctive query answering in expressive description logics. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 179–193. Springer, Heidelberg (2008)
Lutz, C.: Two upper bounds for conjunctive query answering in SHIQ. In: Baader, et al [1]
Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. Inf. Comput. 199(1-2), 132–171 (2005)
Lutz, C., Wolter, F., Zakharyaschev, M.: Temporal description logics: A survey. In: Demri, S., Jensen, C.S. (eds.) Proc. 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), pp. 3–14. IEEE Computer Society, Los Alamitos (2008)
Marx, M., Venema, Y.: Local variations on a loose theme: Modal logic and decidability. In: Finite Model Theory and Its Applications, vol. 7, pp. 371–429. Springer, Heidelberg (2007)
Németi, I.: Free algebras and decidability in algebraic logic. DSc. thesis, Mathematical Institute of The Hungarian Academy of Sciences, Budapest (1986)
Ortiz, M., Calvanese, D., Eiter, T.: Data complexity of query answering in expressive description logics via tableaux. J. of Automated Reasoning 41(1), 61–98 (2008)
Ortiz, M., Simkus, M., Eiter, T.: Conjunctive query answering in SH using knots. In: Baader, et al [1]
Ortiz, M., Simkus, M., Eiter, T.: Worst-case optimal conjunctive query answering for an expressive description logic without inverses. In: Fox and Gomes [7], pp. 504–510
Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for the modal logic k. Journal of Applied Non-Classical Logics 16(1-2), 169–208 (2006)
Pratt, V.R.: Models of program logics. In: FOCS, pp. 115–122. IEEE, Los Alamitos (1979)
Pratt-Hartmann, I.: Data-complexity of the two-variable fragment with counting quantifiers. Information and Computation (2008) (Forthcoming)CoRR, http://arxiv.org/abs/0806.1636
Rudolph, S., Krötzsch, M., Hitzler, P.: Terminological reasoning in \(\mathcal{SHIQ}\) with ordered binary decision diagrams. In: Fox and Gomes [7], pp. 529–534
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Lutz, C., Ortiz, M., Šimkus, M. (2009). Query Answering in Description Logics: The Knots Approach. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-02261-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02260-9
Online ISBN: 978-3-642-02261-6
eBook Packages: Computer ScienceComputer Science (R0)