{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:17:39Z","timestamp":1773317859022,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540692690","type":"print"},{"value":"9783540692706","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11965893_12","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T07:52:22Z","timestamp":1165477942000},"page":"164-178","source":"Crossref","is-referenced-by-count":22,"title":["The Limits of Querying Ontologies"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Rosati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"http:\/\/www.w3.org\/TR\/rdf-schema\/"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Duschka, O.: Complexity of answering queries using materialized views (unpublished, manuscript, 1999) available at: ftp:\/\/ftp.inria.fr\/INRIA\/Projects\/gemo\/gemo\/GemoReport-383.pdf","DOI":"10.1145\/275487.275516"},{"key":"12_CR3","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley Publ.Co, Reading (1995)"},{"key":"12_CR4","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ envelope. In: Proc. of IJCAI 2005, pp. 364\u2013369 (2005)"},{"key":"12_CR5","volume-title":"The Description Logic Handbook: Theory, Implementation and Applications","year":"2003","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"12_CR6","first-page":"1","volume":"66","author":"R. Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the dominoe problem. Mem. Amer. Math. Soc.\u00a066, 1\u201372 (1966)","journal-title":"Mem. Amer. Math. Soc."},{"issue":"1\u20132","key":"12_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(96)00004-5","volume":"82","author":"A. Borgida","year":"1996","unstructured":"Borgida, A.: On the relative expressiveness of description logics and predicate logics. Artificial Intelligence\u00a082(1\u20132), 353\u2013367 (1996)","journal-title":"Artificial Intelligence"},{"key":"12_CR8","unstructured":"Borgida, A., Lenzerini, M., Rosati, R.: Description logics for data bases. In: Baader, et al. (eds.) [5] ch.16, pp. 462\u2013484"},{"key":"12_CR9","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of AAAI\u00a02005, pp. 602\u2013607 (2005)"},{"key":"12_CR10","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of KR 2006\u00a0(2006)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS 1998, pp. 149\u2013158 (1998)","DOI":"10.1145\/275487.275504"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1613\/jair.548","volume":"11","author":"D. Calvanese","year":"1999","unstructured":"Calvanese, D., Lenzerini, M., Nardi, D.: Unifying class-based representation formalisms. J. of Artificial Intelligence Research\u00a011, 199\u2013240 (1999)","journal-title":"J. of Artificial Intelligence Research"},{"key":"12_CR13","unstructured":"Calvanese, D., Rosati, R.: Answering recursive queries under keys and foreign keys is undecidable. In: Proc. of KRDB\u00a02003. CEUR Electronic Workshop Proceedings (2003), http:\/\/ceur-ws.org\/Vol-79\/"},{"key":"12_CR14","unstructured":"Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query answering for description logics with transitive roles. In: Proc. of DL\u00a02006, CEUR Electronic Workshop Proceedings (2006), http:\/\/ceur-ws.org\/Vol-189"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E. Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic\u00a03(1), 53\u201369 (1997)","journal-title":"Bulletin of Symbolic Logic"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Grau, B.C.: A possible simplification of the semantic web architecture. In: Proc. of the 13th Int. World Wide Web Conf (WWW 2004), pp. 704\u2013713 (2004)","DOI":"10.1145\/988672.988769"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-48005-6_15","volume-title":"The Semantic Web - ISWC 2002","author":"I. Horrocks","year":"2002","unstructured":"Horrocks, I., Tessaris, S.: Querying the Semantic Web: a formal approach. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol.\u00a02342, pp. 177\u2013191. Springer, Heidelberg (2002)"},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imielinski","year":"1984","unstructured":"Imielinski, T., L. Jr., W.: Incomplete information in relational databases. J. of the ACM\u00a031(4), 761\u2013791 (1984)","journal-title":"J. of the ACM"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS\u00a02002, pp. 233\u2013246 (2002)","DOI":"10.1145\/543613.543644"},{"issue":"1\u20132","key":"12_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0004-3702(98)00048-4","volume":"104","author":"A.Y. Levy","year":"1998","unstructured":"Levy, A.Y., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artificial Intelligence\u00a0104(1\u20132), 165\u2013209 (1998)","journal-title":"Artificial Intelligence"},{"key":"12_CR21","unstructured":"Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, University of Karlsruhe (2005)"},{"key":"12_CR22","unstructured":"Ortiz, M.M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. of AAAI 2006\u00a0(2006)"},{"key":"12_CR23","unstructured":"Ortiz, M.M., Calvanese, D., Eiter, T.: Data complexity of answering unions of conjunctive queries in $\\mathcal{SHIQ}$ . In: Proc. of DL\u00a02006, CEUR Electronic Workshop Proceedings (2006), http:\/\/ceur-ws.org\/Vol-189"},{"key":"12_CR24","unstructured":"Patel-Schneider, P.F., Hayes, P.J., Horrocks, I., van Harmelen, F.: OWL web ontology language; semantics and abstract syntax. W3C candidate recommendation (November 2002), http:\/\/www.w3.org\/tr\/owl-semantics\/"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Rosati, R.: On the decidability and finite controllability of query processing in databases with incomplete information. In: Proc. of PODS\u00a02006, pp. 356\u2013365 (2006)","DOI":"10.1145\/1142351.1142404"},{"key":"12_CR26","unstructured":"Sirin, E., Parsia, B.: Optimizations for answering conjunctive abox queries: First results. In: Proc. of DL\u00a02006, CEUR Electronic Workshop Proceedings (2006), http:\/\/ceur-ws.org\/Vol-189"},{"key":"12_CR27","unstructured":"Tessaris, S.: Questions and Answers: Reasoning and Querying in Description Logic. PhD thesis, University of Manchester, Department of Computer Science (April 2001)"},{"key":"12_CR28","first-page":"1","volume":"3","author":"B. Trahktenbrot","year":"1963","unstructured":"Trahktenbrot, B.: Impossibility of an algorithm for the decision problem in finite classes. Transactions of the American Mathematical Society\u00a03, 1\u20135 (1963)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1006\/jcss.1997.1455","volume":"54","author":"R. Meyden van der","year":"1997","unstructured":"van der Meyden, R.: The complexity of querying indefinite data about linearly ordered domains. J. of Computer and System Sciences\u00a054(1), 113\u2013135 (1997)","journal-title":"J. of Computer and System Sciences"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Proc. of STOC 1982, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: On the integrity of databases with incomplete information. In: Proc. of PODS 1982, pp. 252\u2013266 (1982)","DOI":"10.1145\/6012.15419"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2013 ICDT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11965893_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T07:33:57Z","timestamp":1736667237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11965893_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540692690","9783540692706"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11965893_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}