Conjunctive query answering in SH using knots

CEUR Workshop Proceedings

Volumn 353, Issue , 2008, Pages

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

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; DATA COMPLEXITY; DESCRIPTION LOGIC; EXPONENTIAL TIME; SATISFIABILITY TESTING;

ALGORITHMS; FORMAL LANGUAGES; INVERSE PROBLEMS; OPTIMIZATION; QUERY LANGUAGES;

DATA DESCRIPTION;

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

References (18)

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. AAAI Press.
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. Hustadt, U.; Motik, B.; and Sattler, U. 2005. Data complexity of reasoning in very expressive description logics. In Proc. IJCAI'05, 466-471.
7. Krötzsch, M.; Rudolph, S.; and Hitzler, P. 2007. Conjunctive queries for a tractable fragment of OWL 1.1. In Proc. ISWC/ASWC'07, LNCS 4825, 310-323. Springer.
8. Levy, A. Y., and Rousset, M.-C. 1998. Combining Horn rules and description logics in CARIN. Artificial Intelligence 104(1-2):165-209.
9. Lutz, C. 2007. Inverse roles make conjunctive queries hard. In Proc. DL'07, 100-111.
10. Lutz, C. 2008. Two Upper Bounds for Conjunctive Query Answering in SHIQ. In Proc. DL'08, to appear.
11. Ortiz, M.; Calvanese, D.; and Eiter, T. 2006. Characterizing data complexity for conjunctive query answering in expressive description logics. In Proc. AAAI'06, 275-280.
12. Ortiz, M.; Calvanese, D.; and Eiter, T. 2008. Data Complexity of Query Answering in Expressive Description Logics via Tableaux. Journal of Automated Reasoning, to appear.
13. Ortiz, M.; Šimkus, M.; and Eiter, T. 2008. Conjunctive Query Answering for an Expressive Description Logic without Inverses. In Proc. AAAI'08, to appear.
14. Rosati, R. 2007. On conjunctive query answering in εL. In Proc. DL'07, 451-458.
15. Schild, K. 1991. A Correspondence Theory for Terminological Logics: Preliminary Report. In Proc. IJCAI'91.
16. Šimkus, M. and Eiter, T. 2007. FDNC: Decidable non-monotonic disjunctive logic programs with function symbols. In Proc. LPAR'07, LNCS 4790, 514-530. Full paper INFSYS RR- 1843-08-01. http://www.kr.tuwien.ac.at/research/ reports/rr0801.pdf.
17. Tessaris, S. 2001. Questions and Answers: Reasoning and Querying in Description Logic. Ph.D. Dissertation, Univ. Manchester, CS Dept.
18. Tobies, S. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, LuFG Theoretical Computer Science, RWTH-Aachen, Germany, 2001.