Two upper bounds for conjunctive query answering in SHIQ

CEUR Workshop Proceedings

Volumn 353, Issue , 2008, Pages

  Lutz, Carsten ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; SATISFIABILITY; UPPER BOUND;

FORMAL LANGUAGES; QUERY PROCESSING;

DATA DESCRIPTION;

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

References (14)

1. 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.
2. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In Proc. of KR'06, pages 260-270. AAAI Press, 2006.
3. B. Glimm, I. Horrocks, I., and U. Sattler. Conjunctive query entailment for SHOQ. In Proc. of DL'07, volume 250 of CEUR-WS, 2007.
4. B. Glimm, C. Lutz, I. Horrocks, and U. Sattler. Answering conjunctive queries in the SHIQ description logic. JAIR, 31:150-197, 2008.
5. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for expressive description logics. In Proc. of LPAR'99, number 1705 in LNAI, pages 161-180. Springer, 1999.
6. I. Horrocks, U. Sattler, and S. Tobies. Reasoning with individuals for the description logic SHIQ. In Proc. of CADE-17, number 1831 in LNCS, pages 482-496. Springer, 2000.
7. U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In Proc. of IJCAI'05, pages 466-471. Professional Book Center, 2005.
8. M. KrÄotzsch, S. Rudolph, and P. Hitzler. Conjunctive queries for a tractable fragment of OWL 1.1. In Proc. of ISWC'07, volume 4825 of LNCS, pages 310-323. Springer, 2007.
9. C. Lutz. Inverse roles make conjunctive queries hard. In Proc. of DL2007, volume 250 of CEUR-WS, 2007.
10. C. Lutz. Two Upper Bounds for Conjunctive Query Answering in (Fragments of) SHIQ. Available from http://lat.inf.tu-dresden.de/clu/papers/.
11. M. Ortiz, D. Calvanese, and T. Eiter. Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics. In Proc. of AAAI'07. AAAI Press, 2007.
12. M. Ortiz, M. Simkus, and T. Eiter. Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses. In Proc. of AAAI'08. AAAI Press, 2008.
13. A. Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. JIIS, 2:265-278, 1993.
14. S. Tobies. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen, 2001.