The limits of querying ontologies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4353 LNCS, Issue , 2006, Pages 164-178

  Rosati, Riccardo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; CONJUNCTIVE QUERIES; INFORMATION ACCESS; ONTOLOGIES AND RULES; QUERYING ONTOLOGIES; RELATIONAL ALGEBRA; RELATIONAL QUERIES; STANDARD REASONING;

COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; FORMAL LANGUAGES; INFORMATION RETRIEVAL; QUERY LANGUAGES;

QUERY PROCESSING;

EID: 84878705786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11965893_12     Document Type: Conference Paper

References (31)

1. http://www.w3.org/TR/rdf-schema/.
2. S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. unpublished manuscript, available at ftp://ftp.inria.fr/ INRIA/Projects/gemo/gemo/GemoReport-383.pdf, 1999.
3. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley Publ. Co., 1995.
4. F. Baader, S. Brandt, and C. Lutz. Pushing the EL envelope. In Proc. of IJCAI 2005, pages 364-369, 2005.
5. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2003.
6. R. Berger. The undecidability of the dominoe problem. Mem. Amer. Math. Soc., 66:1-72, 1966.
7. A. Borgida. On the relative expressiveness of description logics and predicate logics. Artificial Intelligence, 82(1-2):353-367, 1996.
8. A. Borgida, M. Lenzerini, and R. Rosati. Description logics for data bases. In Baader et al. [5], chapter 16, pages 462-484.
9. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. DL-Lite: Tractable description logics for ontologies. In Proc. of AAAI 2005, pages 602-607, 2005.
10. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In Proc. of KR 2006, 2006.
11. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of PODS'98, pages 149-158, 1998.
12. D. Calvanese, M. Lenzerini, and D. Nardi. Unifying class-based representation formalisms. J. of Artificial Intelligence Research, 11:199-240, 1999.
13. D. Calvanese and R. Rosati. Answering recursive queries under keys and foreign keys is undecidable. In Proc. of KRDB 2003. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-79/, 2003.
14. B. Glimm, I. Horrocks, and U. Sattler. Conjunctive query answering for description logics with transitive roles. In Proc. of DL 2006. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-189, 2006.
15. E. Grädel, P. G. Kolaitis, and M. Y. Vardi. On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic, 3(1):53-69, 1997.
16. B. C. Grau. A possible simplification of the semantic web architecture. In Proc. of the 13th Int. World Wide Web Conf. (WWW 2004), pages 704-713, 2004.
17. I. Horrocks and S. Tessaris. Querying the Semantic Web: a formal approach. In Proc. of ISWC 2002, volume 2342 of LNCS, pages 177-191. Springer, 2002.
18. T. Imielinski and W. L. Jr. Incomplete information in relational databases. J. of the ACM, 31(4):761-791, 1984.
19. M. Lenzerini. Data integration: A theoretical perspective. In Proc. of PODS 2002, pages 233-246, 2002.
20. A. Y. Levy and M.-C. Rousset. Combining Horn rules and description logics in CARIN. Artificial Intelligence, 104(1-2):165-209, 1998.
21. B. Motik. Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, University of Karlsruhe, 2005.
22. M. M. Ortiz, D. Calvanese, and T. Eiter. Characterizing data complexity for conjunctive query answering in expressive description logics. In Proc. of AAAI 2006, 2006.
23. M. M. Ortiz, D. Calvanese, and T. Eiter. Data complexity of answering unions of conjunctive queries in SHIQ. In Proc. of DL 2006. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-189, 2006.
24. P. F. Patel-Schneider, P. J. Hayes, I. Horrocks, and F. van Harmelen. OWL web ontology language; semantics and abstract syntax. W3C candidate recommendation, http://www.w3.org/tr/owl-semantics/, november 2002.
25. R. Rosati. On the decidability and finite controllability of query processing in databases with incomplete information. In Proc. of PODS 2006, pages 356-365, 2006.
26. E. Sirin and B. Parsia. Optimizations for answering conjunctive abox queries: First results. In Proc. of DL 2006. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-189, 2006.
27. S. Tessaris. Questions and Answers: Reasoning and Querying in Description Logic. PhD thesis, University of Manchester, Department of Computer Science, Apr. 2001.
28. B. Trahktenbrot. Impossibility of an algorithm for the decision problem in finite classes. Transactions of the American Mathematical Society, 3:1-5, 1963.
29. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. J. of Computer and System Sciences, 54(1):113-135, 1997.
30. M. Y. Vardi. The complexity of relational query languages. In Proc. of STOC'82, pages 137-146, 1982.
31. M. Y. Vardi. On the integrity of databases with incomplete information. In Proc. of PODS'82, pages 252-266, 1982.