Abstract
We give a classification of the complexity of DL-Lite logics extended with role inclusion axioms. We show that the data complexity of instance checking becomes P-hard in the presence of functionality constraints, and coNP-hard if arbitrary number restrictions are allowed, even with primitive concept inclusions. The combined complexity of satisfiability in this case jumps to ExpTime. On the other side, the combined complexity for the logics without number restrictions depends only on the form of concept inclusions and can range from NLogSpace and P to NP; the data complexity for such logics stays in LogSpace.
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
Artale, A., Calvanese, D., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: Complexity of reasoning over Entity-Relationship models. In: Proc. of DL, pp. 163–170 (2007)
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: DL-Lite in the light of first-order logic. In: Proc. of AAAI, pp. 361–366 (2007)
Bernstein, P., Giunchiglia, F., Kementsietsidis, A., Mylopoulos, J., Serafini, L., Zaihrayeu, I.: Data management for peer-to-peer computing: A vision. In: Proc. of WebDB (2002)
Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, Heidelberg (1997)
Borgida, A., Brachman, R., McGuinness, D., Alperin Resnick, L.: CLASSIC: A structural data model for objects. In: Proc. of ACM SIGMOD, pp. 59–67 (1989)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of AAAI, pp. 602–607. AAAI Press, Menlo Park (2005)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tailoring OWL for data intensive ontologies. In: Proc. of OWLED (2005)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of KR, pp. 260–270 (2006)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rosati, R.: Linking data to ontologies: the description logic 3 A . In: Proc. OWLED (2006)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39, 385–429 (2007)
Eiter, T., Gottlob, G., Ortiz, M., Šimkus, M.: Query answering in the description logic Horn-\(\mathcal{SHIQ}\). In: Proc. of JELIA (2008)
Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic \(\mathcal{SHIQ}\). In: Proc. of IJCAI, pp. 399–404 (2007)
Heflin, J., Hendler, J.: A portrait of the Semantic Web in action. IEEE Intelligent Systems 16, 54–59 (2001)
Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics by a reduction to disjunctive Datalog. J. of Automated Reasoning 39, 351–384 (2007)
Kozen, D.: Theory of Computation. Springer, Heidelberg (2006)
Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS, pp. 233–246 (2002)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Schaerf, A.: On the complexity of the instance checking problem in concept languages with existential quantification. J. Intell. Infor. Systems 2, 265–278 (1993)
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
Kontchakov, R., Zakharyaschev, M. (2008). DL − Lite and Role Inclusions. In: Domingue, J., Anutariya, C. (eds) The Semantic Web. ASWC 2008. Lecture Notes in Computer Science, vol 5367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89704-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-89704-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89703-3
Online ISBN: 978-3-540-89704-0
eBook Packages: Computer ScienceComputer Science (R0)