Abstract
We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today’s most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs \(\mathcal{SHOIQ}\) and \(\mathcal{SROIQ}\), serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The prominent OWL-fragment \(\mathcal{SHIQ}\) can be safely extended by safe role expressions, and the tractable fragments \(\mathcal{EL}^{++}\) and DLP retain tractability if extended by conjunction on roles, where in the case of DLP the restriction on role simplicity can even be discarded.
Supported by the European Commission under contracts 027595 NeOn and 215040 ACTIVE, and by the Deutsche Forschungsgemeinschaft (DFG) under the ReaSem project.
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
Rudolph, S., Krötzsch, M., Hitzler, P.: All elephants are bigger than all mice. In: 21st Int. Workshop on Description Logics (DL 2008) (2008)
Krötzsch, M., Rudolph, S., Hitzler, P.: Description logic rules. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008). IOS Press, Amsterdam (2008)
Krötzsch, M., Rudolph, S., Hitzler, P.: Cheap boolean role constructors for description logics. Technical report, Universität Karlsruhe (TH) (2008), http://www.aifb.uni-karlsruhe.de/WBS/sru/TR-RKH-bool-role.pdf
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). In: Proc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 57–67. AAAI Press, Menlo Park (2006)
Baader, F., et al. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2007)
Borgida, A.: On the relative expressiveness of description logics and predicate logics. Artif. Intell. 82, 353–367 (1996)
Lutz, C., Sattler, U.: The complexity of reasoning with boolean modal logics. In: Wolter, F., Wansing, H., de Rijke, M., Zakharyaschev, M. (eds.) Advances in Modal Logics, vol. 3. CSLI Publications, Stanford (2001)
Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen, Germany (2001)
Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information 14(3), 369–395 (2005)
Schmidt, R.A., Tishkovsky, D.: Using tableau to decide expressive description logics with role negation. 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 and ISWC 2007. LNCS, vol. 4825, pp. 438–451. Springer, Heidelberg (2007)
Lutz, C., Walther, D.: PDL with negation of atomic programs. Journal of Applied Non-Classical Logics 15, 189–213 (2005)
Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: An automata-theoretic approach. In: AAAI, pp. 391–396. AAAI Press, Menlo Park (2007)
Glimm, B., Lutz, C., Horrocks, I., Sattler, U.: Answering conjunctive queries in the SHIQ description logic. Journal of Artificial Intelligence Research 31, 150–197 (2008)
Kazakov, Y.: SRIQ and SROIQ are harder than SHOIQ. In: Proc. 21st Int. Workshop on Description Logics (DL 2008), CEUR WS Proceedings (2008)
Demri, S., Nivelle, H.: Deciding regular grammar logics with converse through first-order logic. J. of Logic, Lang. and Inf. 14, 289–329 (2005)
Rudolph, S., Krötzsch, M., Hitzler, P.: Terminological reasoning in SHIQ with ordered binary decision diagrams. In: Proceedings of the 23rd AAAI Conference on Artficial Intelligence (AAAI 2008). AAAI Press, Menlo Park (2008)
Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Universität Karlsruhe (TH), Germany (2006)
Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Proc. 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), Edinburgh, UK. Morgan-Kaufmann Publishers, San Francisco (2005)
Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)
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 and ISWC 2007. LNCS, vol. 4825, pp. 310–323. Springer, Heidelberg (2007)
Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proc. 12th Int. Conf. on World Wide Web (WWW 2003), pp. 48–57. ACM Press, New York (2003)
Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: Proc. 22nd AAAI Conf (AAAI 2007). AAAI Press, Menlo Park (2007)
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
Rudolph, S., Krötzsch, M., Hitzler, P. (2008). Cheap Boolean Role Constructors for Description Logics. 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_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-87803-2_30
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)