Inverse roles make conjunctive queries hard

CEUR Workshop Proceedings

Volumn 250, Issue , 2007, Pages 100-111

  Lutz, Carsten ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY BOUNDS; CONJUNCTIVE QUERIES; EXPONENTIAL TIME; LOWER BOUNDS; REASONING TASKS;

DATA DESCRIPTION; FORMAL LANGUAGES;

QUERY LANGUAGES;

EID: 84872946518     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. F. Baader, D. L. McGuiness, D. Nardi, and P. Patel-Schneider. The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press, 2003.
2. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proceedings of the 17th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS'98), pages 149-158, 1998.
3. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In P. Doherty, J. Mylopoulos, and C. Welty, editors, Proceedings of the Tenth International Conference on Principles of Knowledge Representation and Reasoning (KR'06). AAAI Press, 2006.
4. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
5. B. Glimm, I. Horrocks, and U. Sattler. Conjunctive query answering for description logics with transitive roles. In B. Parsia, U. Sattler, and D. Toman, editors, Proceedings of the 2006 International Workshop on Description Logics (DL'06), volume 189 of CEUR-WS, 2006.
6. B. Glimm, C. Lutz, I. Horrocks, and U. Sattler. Answering conjunctive queries in the SHIQ description logic. In M. Veloso, editor, Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), pages 299.404. AAAI Press, 2007.
7. I. Horrocks, U. Sattler, and S. Tobies. Reasoning with individuals for the description logic SHIQ. In D. MacAllester, editor, Proceedings of the 17th International Conference on Automated Deduction (CADE-17), number 1831 in Lecture Notes in Computer Science, Germany, 2000. Springer Verlag.
8. U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In L. P. Kaelbling and A. Saffiotti, editors, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), pages 466-471. Professional Book Center, 2005.
9. C. Lutz. The Complexity of Reasoning with Concrete Domains. PhD thesis, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2002.
10. C. Lutz Inverse Roles Make Conjunctive Queries Hard. Available from http://lat.inf.tudresden.de/clu/papers/.
11. C. Lutz, C. Areces, I. Horrocks, and U. Sattler. Keys, nominals, and concrete domains. Journal of Artificial Intelligence Research (JAIR), 23:667-726, 2005.
12. M. Ortiz, D. Calvanese, and T. Eiter. Data complexity of answering unions of conjunctive queries in SHIQ. In B. Parsia, U. Sattler, and D. Toman, editors, Proceedings of the 2006 International Workshop on Description Logics (DL'06), volume 189 of CEUR-WS, 2006.
13. A. Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems, 2:265-278, 1993.