Conjunctive queries for a tractable fragment of OWL 1.1

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4825 LNCS, Issue , 2007, Pages 310-323

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

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTABILITY AND DECIDABILITY; KETONES; ONTOLOGY; QUERY LANGUAGES; SEMANTIC WEB; SEMANTICS;

COMPLEXITY ANALYSIS; CONJUNCTIVE QUERIES; DESIGN CRITERION; KNOWLEDGE BASES; WEB ONTOLOGY LANGUAGE OWL;

INFORMATION THEORY;

EID: 49949104444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76298-0_23     Document Type: Conference Paper

References (14)

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.) STOC 1977. Proc. 9th annual ACM Symposium on Theory of Computing, pp. 77-90. ACM Press, New York (1977)
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.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 326-343. Springer, Heidelberg (2000)
3. Hustadt, U., Motik, B., Sattler, U.: A decomposition rule for decision procedures by resolution-based calculi. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 21-35. Springer, Heidelberg (2005)
4. Ortiz, M.M., Calvanese, D., Eiter, T.: Data complexity of answering unions of conjunctive queries in SHIQ. In: Proc. 2006 Description LogicWorkshop (DL 2006), CEUR Electronic Workshop Proceedings (2006), http://ceur-ws.org/
5. Ortiz, M.M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: AAAI2006. Proc. 21st Nat. Conf. on Artificial Intelligence (2006)
6. Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic SHIQ. In: IJCAI 2007. Proc. 21st Int. Joint Conf. on Artificial Intelligence, Hyderabad, India (2007), available at http://www.ijcai.org/papers07/contents.php
7. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: IJCAI 2005. Proc. 19th Int. Joint Conf. on Artificial Intelligence, Morgan-Kaufmann Publishers, Edinburgh, UK (2005)
8. Krisnadhi, A., Lutz, C.: Data complexity in the EL family of DLs. In: Proc. DL 2007. CEUR Electronic Workshop Proceedings (2007)
9. Horrocks, I., Sattler, U.: Decidability of SHIQ with complex role inclusion axioms. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003. Proc. 18th Int. Joint Conf. on Artificial Intelligence, Acapulco, Mexico, pp. 343-348. Morgan-Kaufmann Publishers, San Francisco (2003)
10. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: KR 2006. Proc. 10th Int. Conf. on Principles of Knowledge Representation and Reasoning, pp. 57-67. AAAI Press, Stanford, California, USA (2006)
11. 11. Krötzsch, M., Rudolph, S.: Conjunctive queries for EL with role composition. Technical report, Universität Karlsruhe (TH), Germany (2007), available at http://www.aifb.uni-karlsruhe.de/publikationen/shoPublikation? Publ_id=1463
12. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: KR 2006. Proc. 10th Int. Conf. on Principles of Knowledge Representation and Reasoning, pp. 260-270 (2006)
13. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33, 374-425 (2001)
14. Kozen, D.: Lower bounds for natural proof systems. In: Proc. 18th Symp. on the Foundations of Computer Science, pp. 254-266 (1977)