Query rewriting over shallow ontologies

CEUR Workshop Proceedings

Volumn 1014, Issue , 2013, Pages 316-327

  Kikot, S ^a   Kontchakov, R ^a   Podolskii, V ^b   Zakharyaschev, M ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; FIRST-ORDER; HYPERGRAPH; NON-RECURSIVE DATALOG; QUERY REWRITINGS; FIRST ORDER; POLYNOMIAL SIZE;

BOOLEAN FUNCTIONS; FORMAL LANGUAGES; COMPUTATION THEORY;

DATA DESCRIPTION;

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

References (17)

1. N. Alon and R. Boppana. The monotone circuit complexity of Boolean functions. Combinatorica, 7(1):1-22, 1987.
2. S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, New York, NY, USA, 1st edition, 2009.
3. A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR), 36:1-69, 2009.
4. J. Avigad. Eliminating definitions and Skolem functions in first-order logic. In Proc. of 16th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 139-146, 2001.
5. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2003.
6. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, 1997.
7. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning, 39(3):385-429, 2007.
8. G. Gottlob and T. Schwentick. Rewriting ontological queries into small nonrecursive datalog programs. In Proc. of the 24th Int. Workshop on Description Logics (DL 2011 ), vol. 745 of CEUR Workshop Proceedings. CEUR-WS.org, 2011.
9. M. Grigni and M. Sipser. Monotone separation of logarithmic space from logarithmic depth. J. Comput. Syst. Sci., 50(3):433-437, 1995.
10. S. Jukna. Boolean Function Complexity | Advances and Frontiers, volume 27 of Algorithms and Combinatorics. Springer, 2012.
11. S. Kikot, R. Kontchakov, and M. Zakharyaschev. On (In)Tractability of OBDA with OWL 2 QL. In Proc. of the 24th Int. Workshop on Description Logics (DL 2011 ), vol. 745 of CEUR Workshop Proceedings. CEUR-WS.org, 2011.
12. S. Kikot, R. Kontchakov, and M. Zakharyaschev. Conjunctive query answering with OWL 2 QL. In Proc. of the 13th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2012 ). AAAI Press, 2012.
13. S. Kikot, R. Kontchakov, V. Podolskii, and M. Zakharyaschev. Exponential lower bounds and separation for query rewriting. In Proc. of the 39th Int. Colloquium on Automata, Languages, and Programming (ICALP 2012 ), vol. 7392 of LNCS, pages 263-274. Springer, 2012.
14. S. Kikot, R. Kontchakov, V. Podolskii, and M. Zakharyaschev. Long rewritings, short rewritings. In Proc. of the 2012 Int. Workshop on Description Logics (DL 2012 ), vol. 846 of CEUR Workshop Proceedings. CEUR-WS.org, 2012.
15. R. Raz and A. Wigderson. Monotone circuits for matching require linear depth. J. ACM, 39(3):736-744, 1992.
16. A. Razborov. Lower bounds for the monotone complexity of some Boolean functions. Dokl. Akad. Nauk SSSR, 281(4):798-801, 1985.
17. A. Razborov. Lower bounds for deterministic and nondeterministic branching programs. In Proc. of the 8th Int. Symposium on Fundamentals of Computation Theory (FCT'91), vol. 529 of LNCS, pages 47-60. Springer, 1991