Query answering with DBoxes is hard

Electronic Notes in Theoretical Computer Science

Volumn 278, Issue 1, 2011, Pages 71-84

  Franconi, Enrico ^a   Ibáñez García, Yazmín Angélica ^a   Seylan, Inanç ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

conjunctive queries; Description logics; hybrid logic; model theory

Indexed keywords

CONJUNCTIVE QUERIES; DATA COMPLEXITY; DATA-INTENSIVE APPLICATION; DESCRIPTION LOGIC; EXPRESSIVE DESCRIPTION LOGIC; HYBRID LOGIC; KNOWLEDGE BASE; KNOWLEDGE BASIS; MODEL THEORY; OPEN PROBLEMS; POLYNOMIAL-TIME; PROOF OF CONCEPT; QUERY ANSWERING; RELATIONAL DATABASE;

DATABASE SYSTEMS; FORMAL LANGUAGES; INVERSE PROBLEMS; KNOWLEDGE BASED SYSTEMS; POLYNOMIAL APPROXIMATION;

DATA DESCRIPTION;

EID: 80155130431     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2011.10.007     Document Type: Conference Paper

References (16)

1. S. Abiteboul, R. Hull, and V. Vianu Foundations of Databases 1995 Addison-Wesley
2. C. Areces, and B. ten Cate Hybrid logics P. Blackburn, J. van Benthem, F. Wolter, Handbook of Modal Logic 2007 Elsevier
3. F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, and P.F. Patel-Schneider The Description Logic Handbook: Theory, Implementation, and Applications 2003 Cambridge University Press
4. P. Blackburn, M. de Rijke, and Y. Venema Modal logic 2001 Cambridge University Press New York, NY, USA
5. Calvanese, D., G. D. Giacomo, D. Lembo, M. Lenzerini and R. Rosati, Data complexity of query answering in description logics, in: P. Doherty, J. Mylopoulos and C. A. Welty, editors, KR (2006), pp. 260-270.
6. Calvanese, D., G. D. Giacomo, D. Lembo, M. Lenzerini and R. Rosati, Tractable reasoning and efficient query answering in description logics: The DL-Lite family 39 (2007), pp. 385-429.
7. Glimm, B., Y. Kazakov and C. Lutz, Status qio: An update, in: Proceedings of the 24th International Workshop on Description Logics, 2011, to appear.
8. B. Glimm, C. Lutz, I. Horrocks, and U. Sattler Conjunctive query answering for the description logic shiq J. Artif. Intell. Res. (JAIR) 31 2008 157 204 (Pubitemid 351761985)
9. R. Goré Tableau methods for modal and temporal logics M. D'Agostino, D.M. Gabbay, R. Hahnle, J. Posegga, Handbook of Tableau Methods 1999 297 396
10. I. Horrocks, and U. Sattler A tableau decision procedure for SHOIQ J. Autom. Reason. 39 2007 249 276 (Pubitemid 47342450)
11. A.Y. Levy, and M.-C. Rousset Combining horn rules and description logics in carin Artif. Intell. 104 1998 165 209 (Pubitemid 128400989)
12. M. Ortiz, D. Calvanese, and T. Eiter Data complexity of query answering in expressive description logics via tableaux J. Autom. Reasoning 41 2008 61 98
13. C.H. Papadimitriou Computational complexity 1994 Addison-Wesley
14. S. Rudolph, and B. Glimm Nominals, inverses, counting, and conjunctive queries or: Why infinity is your friend! J. Artif. Intell. Res. (JAIR) 39 2010 429 481
15. Schwendimann, S., A new one-pass tableau calculus for pltl, in: TABLEAUX '98: Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (1998), pp. 277-292.
16. Seylan, I., E. Franconi and J. de Bruijn, Effective query rewriting with ontologies over dboxes, in: C. Boutilier, editor, IJCAI, 2009, pp. 923-925.