Abstract
Description Logics (DLs) play a central role as formalisms for representing ontologies and reasoning about them. This lecture introduces the basics of DLs. We discuss the knowledge modeling capabilities of some of the most prominent DLs, including expressive ones, and present some DL reasoning services. Particular attention is devoted to the query answering problem, and to the increasingly popular framework in which data repositories are queried through DL ontologies. We give an overview of the main challenges that arise in this setting, survey some query answering techniques for both lightweight and expressive DLs, and give an overview of the computational complexity landscape.
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
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: from Relations to Semistructured Data and XML. Morgan Kaufmann (2000)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley Publ. Co. (1995)
Adali, S., Candan, K.S., Papakonstantinou, Y., Subrahmanian, V.S.: Query caching and optimization in distributed mediator systems. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 137â148 (1996)
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. of Artificial Intelligence Research 36, 1â69 (2009)
Baader, F.: Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In: Proc. of the 12th Int. Joint Conf. on Artificial Intelligence, IJCAI 1991 (1991)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, IJCAI 2005 (2005)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press (2007)
Baader, F., Hladik, J., Lutz, C., Wolter, F.: From tableaux to automata for description logics. Fundamenta Informaticae 57, 1â33 (2003)
Bienvenu, M., Eiter, T., Lutz, C., Ortiz, M., Šimkus, M.: Query answering in the description logic \(\mathcal{S}\). In: Proc. of the 23rd International Workshop on Description Logics, DL 2010. CEUR-WS (2010)
Bienvenu, M., Ortiz, M., Å imkus, M.: Answering expressive path queries over lightweight DL knowledge bases. In: Description Logics (2012)
Bonatti, P., Lutz, C., Murano, A., Vardi, M.Y.: The complexity of enriched ÎŒ-calculi. Logical Methods in Computer Science 4(3:11), 1â27 (2008)
Buneman, P.: Semistructured data. In: Proc. of the 16th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, PODS 1997, pp. 117â121 (1997)
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(3), 385â429 (2007)
Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, PODS 1998, pp. 149â158 (1998)
Calvanese, D., De Giacomo, G., Lenzerini, M.: 2ATAs make DLs easy. In: CEUR Electronic Workshop Proceedings of Proc. of the 2002 Description Logic Workshop,DLÂ 2002, pp. 107â118 (2002)
Calvanese, D., De Giacomo, G., Lenzerini, M.: Conjunctive query containment and answering under description logics constraints. ACM Trans. on Computational Logic 9(3), 22.1â22.31 (2008)
Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Logical foundations of peer-to-peer data integration. In: Proc. of the 23rd ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, PODSÂ 2004, pp. 241â251 (2004)
Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Rewriting regular expressions in semi-structured data. In: Proc. of ICDT 1999 Workshop on Query Processing for Semi-Structured Data and Non-Standard Data Formats (1999)
Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Proc. of the Seventh International Conference on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 176â185 (2000)
Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Reasoning on regular path queries. SIGMOD Record 32(4), 83â92 (2003)
Calvanese, D., De Giacomo, G., Vardi, M.Y.: Decidable containment of recursive queries. Theoretical Computer Science 336(1), 33â56 (2005)
Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: An automata-theoretic approach. In: Proc. of the 22nd AAAI Conference on Artificial Intelligence, AAAI 2007, pp. 391â396 (2007)
Calvanese, D., Eiter, T., Ortiz, M.: Regular path queries in expressive description logics with nominals. In: Boutilier, C. (ed.) Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, IJCAI 2009, pp. 714â720 (2009)
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of the 9th ACM Symp. on Theory of Computing, STOC 1977, pp. 77â90 (1977)
Chortaras, A., Trivela, D., Stamou, G.: Optimized Query Rewriting for OWL 2 QL. In: BjÞrner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 192â206. Springer, Heidelberg (2011), http://dl.acm.org/citation.cfm?id=2032266.2032282
Cuenca Grau, B., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P., Sattler, U.: OWL 2: The next step for OWL. Journal of Web Semantics 6(4), 309â322 (2008)
De Giacomo, G.: Decidability of Class-Based Knowledge Representation Formalisms. Ph.D. thesis, Dipartimento di Informatica e Sistemistica, Università di Roma âLa Sapienzaâ (1995)
De Giacomo, G., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proc. of the 12th Nat. Conf. on Artificial Intelligence, AAAI 1994, pp. 205â212 (1994)
Eiter, T., Gottlob, G., Ortiz, M., Å imkus, M.: Query answering in the description logic horn-\(\mathcal{SHIQ}\). In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 166â179. Springer, Heidelberg (2008)
Eiter, T., Lutz, C., Ortiz, M., Å imkus, M.: Query Answering in Description Logics: The Knots Approach. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol. 5514, pp. 26â36. Springer, Heidelberg (2009)
Eiter, T., Lutz, C., Ortiz, M., Å imkus, M.: Query answering in description logics with transitive roles. In: Boutilier, C. (ed.) Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, IJCAIÂ 2009, pp. 759â764 (2009)
Eiter, T., Ortiz, M., Simkus, M.: Conjunctive query answering in the description logic SH using knots. J. Comput. Syst. Sci. 78(1), 47â85 (2012)
Eiter, T., Ortiz, M., Šimkus, M., Tran, T.K., Xiao, G.: Query rewriting for Horn-SHIQ plus rules. In: Proc. of the 26th AAAI Conference on Artificial Intelligence, AAAI 2012 (to appear, 2012)
Franconi, E.: Description logics for natural language processing. In: Working Notes of the AAAI Fall Symposium on âKnowledge Representation for Natural Language Processing in Implemented Systemsâ, pp. 37â44 (1994)
Gehrke, M., Burkert, G., Forster, P., Franconi, E.: Natural language processing and description logics. In: Peltason, C., von Luck, K., Kindermann, C. (eds.) Proc. of the Terminological Logic Users Workshop, pp. 162â164. Department of Computer Science, Technische UniversitÀt Berlin (1991)
Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic \(\mathcal{SHIQ}\). Journal of Artificial Intelligence Research 31, 151â198 (2008)
Glimm, B., Horrocks, I., Sattler, U.: Unions of conjunctive queries in SHOQ. In: Proc. of the 11th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2008), pp. 252â262. AAAI Press/The MIT Press (2008)
Glimm, B., Kazakov, Y.: Role Conjunctions in Expressive Description Logics. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 391â405. Springer, Heidelberg (2008)
Glimm, B., Kazakov, Y., Lutz, C.: Status QIO: An update. In: Proc. of the 2009 Description Logic Workshop, DL 2009. CEUR Workshop Proceedings, vol. 745 (2011)
Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: IEEE 27th International Conference on Data Engineering, ICDE, pp. 2â13 (April 2011)
Gottlob, G., Orsi, G., Pieris, A., Å imkus, M.: Datalog and its Extensions for the Semantic Web Databases. In: Eiter, T., Krennwallner, T. (eds.) Reasoning Web 2012, vol. 7487, pp. 54â77. Springer, Heidelberg (2012)
Gottlob, G., Schwentick, T.: Rewriting ontological queries into small nonrecursive datalog programs. In: Rosati, R., Rudolph, S., Zakharyaschev, M. (eds.) Description Logics. CEUR Workshop Proceedings, vol. 745, CEUR-WS.org (2011)
GrÀdel, E.: Why are modal logics so robustly decidable? Bulletin of the European Association for Theoretical Computer Science 68, 90â103 (1999)
Gupta, A., Ullman, J.D.: Generalizing conjunctive query containment for view maintenance and integrity constraint verification (abstract). In: Workshop on Deductive Databases (In conjunction with JICSLP), Washington D.C. (USA), p. 195 (1992)
Hladik, J.: A tableau system for the description logic SHIO. In: Sattler, U. (ed.) IJCAR Doctoral Programme. CEUR Workshop Proceedings, vol. 106, CEUR-WS.org (2004)
Horrocks, I., Kutz, O., Sattler, U.: The irresistible \(\mathcal{SRIQ}\). In: Proc. of the 1st Int. Workshop on OWL: Experiences and Directions, OWLEDÂ 2005 (2005)
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KRÂ 2006), pp. 57â67. AAAI Press (2006)
Horrocks, I., Rector, A., Goble, C.: A description logic based schema for the classification of medical data. In: CEUR Electronic Workshop Proceedings, Proc. of the 3rd Int. Workshop on Knowledge Representation Meets Databases, KRDB 1996, pp. 24â28 (1996), http://ceur-ws.org/Vol-4/
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. J. of the Interest Group in Pure and Applied Logic 8(3), 239â264 (2000)
Horrocks, I., Sattler, U., Tobies, S.: Reasoning with Individuals for the Description Logic \(\mathcal{SHIQ}\). In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 482â496. Springer, Heidelberg (2000)
Horrocks, I., Tessaris, S.: A conjunctive query language for description logic ABoxes. In: Proc. of the 17th Nat. Conf. on Artificial Intelligence, AAAI 2000, pp. 399â404 (2000)
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 (LNAI), vol. 3452, pp. 21â35. Springer, Heidelberg (2005)
Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, IJCAI 2005, pp. 466â471 (2005)
Immerman, N.: Expressibility and parallel complexity. SIAM J. Comput. 18(3), 625â638 (1989)
Kazakov, Y.: \(\mathcal{RIQ}\) and \(\mathcal{SROIQ}\) are harder than \(\mathcal{SHOIQ}\). In: Proc. of the Eleventh International Conference on the Principles of Knowledge Representation and Reasoning, KR 2008, pp. 274â284 (2008)
Kikot, S., Kontchakov, R., Zakharyaschev, M.: On (in)tractability of OBDA with OWL 2 QL. In: Rosati, R., Rudolph, S., Zakharyaschev, M. (eds.) Description Logics. CEUR Workshop Proceedings, vol. 745, CEUR-WS.org (2011), http://dblp.uni-trier.de/db/conf/dlog/dlog2011.html#KikotKZ11
Krisnadhi, A., Lutz, C.: Data Complexity in the \(\mathcal{EL}\) Family of Description Logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 333â347. Springer, Heidelberg (2007)
Krötzsch, M.: OWL 2 profiles: An Introduction to Lightweight Ontology Languages. In: Eiter, T., Krennwallner, T. (eds.) Reasoning Web 2012. LNCS, vol. 7487, Springer, Heidelberg (2012)
Krötzsch, M., Rudolph, S.: Conjunctive queries for \(\mathcal{EL}\) with composition of roles. In: Proc. of the 2007 Description Logic Workshop, DL 2007. CEUR Electronic Workshop Proceedings, vol. 250 (2007), http://ceur-ws.org/Vol-250/
Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence, AAAI 2007, pp. 452â457. AAAI Press (2007)
Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of the 21st ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, PODSÂ 2002, pp. 233â246 (2002)
Levy, A.Y., Rousset, M.C.: Combining Horn rules and description logics in CARIN. Artificial Intelligence 104(1-2), 165â209 (1998)
Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic \(\mathcal{EL}\) using a relational database system. In: Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, IJCAIÂ 2009, pp. 2070â2075. AAAI Press (2009)
Lutz, C.: Complexity of Terminological Reasoning Revisited. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 181â200. Springer, Heidelberg (1999)
Lutz, C.: Inverse roles make conjunctive queries hard. In: Proc. of the 2007 Description Logic Workshop, DL 2007. CEUR Electronic Workshop Proceedings, vol. 250, pp. 100â111 (2007), http://ceur-ws.org/Vol-250/
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, F., Lutz, C., Motik, B. (eds.) Description Logics. CEUR Workshop Proceedings, vol. 353, CEUR-WS.org (2008)
McGuinness, D.L.: Ontology-enhanced search for primary care medical literature. In: Proc. of the Int. Medical Informatics Association Working Group 6 â Conference on Natural Language Processing and Medical Concept Representation, IMIA 1999 (1999)
Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. Ph.D. thesis, UnivesitÀt Karlsruhe (TH), Karlsruhe, Germany (January 2006)
Nebel, B.: Terminological reasoning is inherently intractable. Artificial Intelligence 43, 235â249 (1990)
Németi, I.: Free algebras and decidability in algebraic logic. DSc. thesis, Mathematical Institute of The Hungarian Academy of Sciences, Budapest (1986)
Noy, N.F.: Semantic integration: A survey of ontology-based approaches. SIGMOD Record 33(4), 65â70 (2004)
Ortiz, M.: Query Answering in Expressive Description Logics: Techniques and Complexity Results. Ph.D. thesis, Vienna University of Technology (2010)
Ortiz, M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. of the 21st Nat. Conf. on Artificial Intelligence, AAAIÂ 2006. AAAI Press (July 2006)
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., Rudolph, S., Šimkus, M.: Query answering is undecidable in DLs with regular expressions, inverses, nominals, and counting. Tech. Rep. INFSYS RR-1843-10-03, Institut fÌr Informationssysteme, Technische UniversitÀt Wien, A-1040 Vienna, Austria (April 2010)
Ortiz, M., Rudolph, S., Simkus, M.: Worst-case optimal reasoning for the Horn-DL fragments of OWL 1 and 2. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) KR 2010, AAAI Press (2010)
Ortiz, M., Rudolph, S., Simkus, M.: Query answering in the Horn fragments of the description logics SHOIQ and SROIQ. In: Walsh, T. (ed.) IJCAI, pp. 1039â1044. IJCAI/AAAI (2011)
Ortiz, M., Å imkus, M., Eiter, T.: Worst-case optimal conjunctive query answering for an expressive description logic without inverses. In: Fox, D., Gomes, C.P. (eds.) AAAI 2008, pp. 504â510. AAAI Press (2008)
Patel-Schneider, P., Hayes, P., Horrocks, I.: OWL Web Ontology Language semantics and abstract syntax â W3C recommendation. Tech. rep., World Wide Web Consortium (February 2004), http://www.w3.org/TR/owl-semantics/
Pérez-Urbina, H., Motik, B., Horrocks, I.: A comparison of query rewriting techniques for DL-Lite. In: Grau, B.C., Horrocks, I., Motik, B., Sattler, U. (eds.) Description Logics. CEUR Workshop Proceedings, vol. 477, CEUR-WS.org (2009)
Pérez-Urbina, H., Motik, B., Horrocks, I.: Tractable query answering and rewriting under description logic constraints. J. Applied Logic 8(2), 186â209 (2010)
Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking Data to Ontologies. In: Spaccapietra, S. (ed.) Journal on Data Semantics X. LNCS, vol. 4900, pp. 133â173. Springer, Heidelberg (2008)
Pratt, V.R.: Models of program logic. In: Proc. of the 20th Annual Symp. on the Foundations of Computer Science (FOCS 1979), pp. 115â122 (1979)
Pratt-Hartmann, I.: Data-complexity of the two-variable fragment with counting quantifiers. Information and Computation 207(8), 867â888 (2009)
Rector, A., Bechhofer, S., Goble, C.A., Horrocks, I., Nowlan, W.A., Solomon, W.D.: The grail concept modelling language for medical terminology. Artificial Intelligence in Medicine 9, 139â171 (1997)
Rosati, R.: On conjunctive query answering in \(\mathcal{EL}\). In: Proc. of the 2007 Description Logic Workshop, DL 2007. CEUR Electronic Workshop Proceedings, vol. 250 (2007), http://ceur-ws.org/Vol-250/
Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, KR 2010 (2010)
Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: Why infinity is your friend! J. of Artificial Intelligence Research 39, 429â481 (2010)
Sattler, U., Vardi, M.Y.: The hybrid ÎŒ-calculus. In: Proc. of the Int. Joint Conf. on Automated Reasoning, IJCAR 2001, pp. 76â91 (2001)
Schaerf, A.: On the complexity of the instance checking problem in concept languages with existential quantification. J. of Intelligent Information Systems 2, 265â278 (1993)
Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Proc. of the 12th Int. Joint Conf. on Artificial Intelligence, IJCAI 1991, pp. 466â471 (1991)
Tessaris, S.: Questions and Answers: Reasoning and Querying in Description Logic. Ph.D. thesis, University of Manchester, Department of Computer Science (April 2001)
Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. of Artificial Intelligence Research 12, 199â217 (2000)
Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. Ph.D. thesis, LuFG Theoretical Computer Science, RWTH-Aachen, Germany (2001)
Ullman, J.D.: Information integration using logical views. Theoretical Computer Science 239(2), 189â210 (2000)
Vardi, M.Y.: The complexity of relational query languages. In: Proc. of the 14th ACM SIGACT Symp. on Theory of Computing, STOC 1982, pp. 137â146 (1982)
Vardi, M.Y.: Reasoning about the Past with Two-Way Automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628â641. Springer, Heidelberg (1998)
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences 32, 183â221 (1986)
Vollmer, H.: Introduction to circuit complexity - a uniform approach. In: Texts in Theoretical Computer Science. Springer (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ortiz, M., Å imkus, M. (2012). Reasoning and Query Answering in Description Logics. In: Eiter, T., Krennwallner, T. (eds) Reasoning Web. Semantic Technologies for Advanced Query Answering. Reasoning Web 2012. Lecture Notes in Computer Science, vol 7487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33158-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-33158-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33157-2
Online ISBN: 978-3-642-33158-9
eBook Packages: Computer ScienceComputer Science (R0)