Conjunctive queries for EL with role composition

CEUR Workshop Proceedings

Volumn 250, Issue , 2007, Pages 355-362

  Krötzsch, Markus ^a   Rudolph, Sebastian ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINED COMPLEXITY; COMPLEX ROLES; CONJUNCTIVE QUERIES; EXPRESSIVE DESCRIPTION LOGIC; KNOWLEDGE BASIS; POLYNOMIAL-TIME; QUERY ANSWERING; REASONING TASKS;

FORMAL LANGUAGES; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES;

DATA DESCRIPTION;

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

References (15)

1. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In Hopcroft, J.E., Friedman, E.P., Harrison, M.A., eds.: Proc. STOC'77, ACM Press (1977) 77-90.
2. Horrocks, I., Sattler, U., Tessaris, S., Tobies, S.: How to decide query containment under constraints using a description logic. In Parigot, M., Voronkov, A., eds.: Proc. LPAR 2000. Volume 1955 of LNAI., Springer (2000) 326-343.
3. Hustadt, U., Motik, B., Sattler, U.: A decomposition rule for decision procedures by resolution-based calculi. In: Proc. LPAR 2004. (2005) 21-35.
4. Ortiz, M.M., Calvanese, D., Eiter, T.: Data complexity of answering unions of conjunctive queries in SHIQ. In: Proc. DL 2006, CEUR Electronic Workshop Proceedings (2006).
5. Ortiz, M.M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. AAAI'06. (2006).
6. Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic SHIQ. In: Proc. IJCAI-07, Hyderabad, India (2007).
7. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: Proc. KR2006, AAAI Press (2006) 57-67.
8. Baader, F., Brandt, S., Lutz, C.: Pushing the εL envelope. In: Proc. IJCAI-05, Edinburgh, UK, Morgan-Kaufmann Publishers (2005).
9. Krisnadhi, A., Lutz, C.: Data complexity in the εL family of DLs. In: Proc. DL 2007, CEUR Electronic Workshop Proceedings (2007).
10. Horrocks, I., Sattler, U.: Decidability of SHIQ with complex role inclusion axioms. In: Proc. IJCAI-03, Acapulco, Mexico, Morgan-Kaufmann Publishers (2003) 343-348.
11. Krötzsch, M., Rudolph, S.: Conjunctive queries for εL with role composition. Technical report, Universität Karlsruhe (TH), Germany (2007) Available athttp://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ- id=1463.
12. Wessel, M.: Obstacles on the way to qualitative spatial reasoning with description logics: Some undecidability results. In: Proc. DL 2001. (2001).
13. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. KR 2006. (2006) 260-270.
14. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33 (2001) 374-425.
15. Kozen, D.: Lower bounds for natural proof systems. In: Proc. 18th Symp. on the Foundations of Computer Science. (1977) 254-266.