Characterizing data complexity for conjunctive query answering in expressive description logics

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 275-280

  Ortiz, Magdalena ^a,b   Calvanese, Diego ^a   Eiter, Thomas ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATABASE SYSTEMS; OPTIMIZATION; QUERY LANGUAGES; WORLD WIDE WEB;

ATOMIC QUERIES; CONJUNCTIVE QUERIES (CQS); DESCRIPTION LOGICS (DLS); SEMANTIC WEB;

FORMAL LOGIC;

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

References (24)

1. S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. In Proc. of PODS'98, 1998.
2. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2003.
3. F. Baader and U. Sattler. An overview of tableau algorithms for description logics. Studia Logica, 69(1):5-40, 2001.
4. A. Borgida and R. J. Brachman. Conceptual modeling with description logics. In Baader et al. [2], chapter 10.
5. D. Calvanese and G. De Giacomo. Expressive description logics. In Baader et al. [2], chapter 5.
6. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. DL-Lite: Tractable description logics for ontologies. In Proc. of AAAI 2005, 2005.
7. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In Proc. of KR 2006, 2006.
8. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of PODS'98, 1998.
9. D. Calvanese, G. De Giacomo, and M. Lenzerini. Answering queries using views over description logics knowledge bases. In Proc. of AAAI 2000, 2000.
10. F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Deduction in concept languages: From subsumption to instance checking. J. of Log. and Comp., 4(4):423-452, 1994.
11. J. Heflin and J. Hendler. A portrait of the Semantic Web in action. IEEE Intelligent Systems, 16(2):54-59, 2001.
12. I. Horrocks, P. F. Patel-Schneider, and F. van Harmelen. From SHIQ and RDF to OWL: The making of a web ontology language. J. of Web Semantics, 1(1):7-26, 2003.
13. I. Horrocks and U. Sattler. A tableaux decision procedure for SHOIQ. In Proc. of IJCAI 2005, 2005.
14. I. Horrocks, U. Sattler, and S. Tobies. Reasoning with individuals for the description logic SHIQ. In Proc. of CADE 2000, volume 1831 of LNCS. Springer, 2000.
15. I. Horrocks and S. Tessaris. A conjunctive query language for description logic ABoxes. In Proc. of AAAI 2000, 2000.
16. U. Hustadt, B. Motik, and U. Sattler. A decomposition rule for decision procedures by resolution-based calculi. In Proc. of LPAR 2004, 2004.
17. U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In Proc. of IJCAI 2005, 2005.
18. M. Lenzerini. Data integration: A theoretical perspective. In Proc. of PODS 2002, 2002.
19. A. Y. Levy and M.-C. Rousset. Combining Horn rules and description logics in CARIN. Artificial Intelligence, 104(1-2): 165-209, 1998.
20. M. M. Ortiz de la Fuente, D. Calvanese, and T. Eiter. Data complexity of answering unions of conjunctive queries in SHIQ. Technical report, Fac. of Computer Science, Free Univ. of Bozen-Bolzano, Mar. 2006. Available at www.inf.unibz.it/~calvanese/papers/orti-calv-eite-TR-2006-03.pdf.
21. Also available as Technical Report INFSYS RR 1843-61-03, Inst. of Information Systems, Vienna Univ. of Technology.
22. P. Patel-Schneider, P. Hayes, and I. Horrocks. OWL Web Ontology Language semantics and abstract syntax - W3C recommendation. Technical report, World Wide Web Consortium, Feb. 2004.
23. S. Tobies. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, LuFG Theoretical Computer Science, RWTH-Aachen, Germany, 2001.
24. M. Y. Vardi. The complexity of relational query languages. In Proc. of STOC'82, 1982.