Worst-case optimal conjunctive query answering for an expressive description logic without inverses

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 504-510

  Ortiz, Magdalena ^a   Šimkus, Mantas ^a   Eiter, Thomas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; ARTIFICIAL INTELLIGENCE; DATA DESCRIPTION; QUERY LANGUAGES; TAXONOMIES; TREES (MATHEMATICS);

CONJUNCTIVE QUERIES; DATA COMPLEXITIES; DESCRIPTION LOGICS; EXPONENTIAL TIMES; KNOWLEDGE BASES; SATISFIABILITY TESTING;

BIONICS;

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

References (17)

1. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2006. Data complexity of query answering in description logics. In Proc. KR'06, 260-270.
2. Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proc. ACM PODS'98, 149-158.
3. Calvanese, D.; Eiter, T.; and Ortiz, M. 2007. Answering regular path queries in expressive description logics: An automata-theoretic approach. In Proc. AAAI'07, 391-396.
4. Glimm, B.; Horrocks, I.; Lutz, C.; and Sattler, U. 2007. Conjunctive query answering for the description logic SHIQ. In Proc. IJCAI'07, 399-404.
5. Glimm, B.; Horrocks, I.; Sattler, U.; 2007. Conjunctive query entailment for SHOQ. In Proc. DL'07, 65-75.
6. Heflin, J., and Hendler, J. 2001. A portrait of the Semantic Web in action. IEEE Intelligent Systems 16(2):54-59.
7. Hustadt, U.; Motik, B.; and Sattler, U. 2005. Data complexity of reasoning in very expressive description logics. In Proc. IJCAI'05, 466-471.
8. Krötzsch, M.; Rudolph, S.; and Hitzler, P. 2007. Conjunctive queries for a tractable fragment of OWL 1.l. In Proc. ISWC/ASWC 2007, LNCS 4825, 310-323.
9. Levy, A. Y., and Rousset, M.-C. 1998. Combining Horn rules and description logics in CARIN. Artificial Intelligence 104(1-2):165-209.
10. Lutz, C. 2007. Inverse roles make conjunctive queries hard. In Calvanese, D., et al., eds., Proc. DL'07, 100-111.
11. Lutz, C. 2008. Two Upper Bounds for Conjunctive Query Answering in SHIQ. In Proc. DL'08, to appear.
12. Ortiz, M.; Calvanese, D.; and Eiter, T. 2008. Data Complexity of Query Answering in Expressive Description Logics via Tableaux. J. of Automated Reasoning, to appear.
13. Rosati, R. 2007. On conjunctive query answering in ε £. In Calvanese, D., et al., eds., Proc. DL'07, 451-458.
14. Schaerf, A. 1993. On the Complexity of the Instance Checking Problem in Concept Languages with Existential Quantification. In J. Intell. Inf. Syst., 265-278.
15. Schild, K. 1991. A Correspondence Theory for Terminological Logics: Preliminary Report. In Proc. IJCAI'91.
16. Šimkus, M. and Eiter, T. 2007. double struck F sign double struck D sign ℕℂ: Decidable non monotonic disjunctive logic programs with function symbols. In Proc. LPAR'07, LNCS 4790, 514-530.
17. Tessaris, S. 2001. Questions and Answers: Reasoning and Querying in Description Logic. Ph.D. Dissertation, Univ. Manchester, CS Dept.