Abstract
We show that adding role conjunctions to the Description Logics (DLs) \(\mathcal{SHI}\) and \(\mathcal{SHOIF}\) causes a jump in the computational complexity of the standard reasoning tasks from ExpTime-complete to 2ExpTime-complete and from NExpTime-complete to N2ExpTime-hard respectively. We further show that this increase is due to a subtle interaction between inverse roles, role hierarchies, and role transitivity in the presence of role conjunctions and that for the DL \(\mathcal{SHQ}\) a jump in the computational complexity cannot be observed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)
Kazakov, Y.: \(\mathcal{RIQ}\) and \(\mathcal{SROIQ}\) are harder than \(\mathcal{SHOIQ}\). In: Proc. of the 11th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2008). AAAI Press/The MIT Press (2008)
Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic \(\mathcal{SHIQ}\). J. of Artificial Intelligence Research 31, 151–198 (2008)
Lange, M., Lutz, C.: 2-ExpTime lower bounds for Propositional Dynamic Logics with intersection. J. of Symbolic Logic 70(5), 1072–1086 (2005)
Glimm, B., Kazakov, Y.: Role conjunctions in expressive description logics. Technical report, University of Oxford (2008), http://www.comlab.oxford.ac.uk//files/361/RoleConjunctions.pdf
Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen (2001)
Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI 1991) (1991)
Kazakov, Y., Motik, B.: A resolution-based decision procedure for \(\mathcal{SHOIQ}\). J. of Automated Reasoning 40(2–3), 89–116 (2008)
Hustadt, U., Motik, B., Sattler, U.: Reducing \(\mathcal{SHIQ}^-\) Description Logic to Disjunctive Datalog Programs. In: Proc. of the 9th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2004) (2004)
Sipser, M.: Introduction to the Theory of Computation, 2 edn. Course Technology (February 2005)
Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. of the ACM 28(1), 114–133 (1981)
Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. of Artificial Intelligence Research 12 (2000)
Börger, E., Grädel, E., Gurevich, Y.: The classical decision problem. J. of Logic, Language and Information 8(4), 478–481 (1999)
Lutz, C.: Inverse roles make conjunctive queries hard. In: Proc. of the 2007 Description Logic Workshop (DL 2007) (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
Glimm, B., Kazakov, Y. (2008). Role Conjunctions in Expressive Description Logics. In: Cervesato, I., Veith, H., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science(), vol 5330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89439-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-89439-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89438-4
Online ISBN: 978-3-540-89439-1
eBook Packages: Computer ScienceComputer Science (R0)