Exponential lower bounds and separation for query rewriting

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

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 263-274

  Kikot, Stanislav ^a   Kontchakov, Roman ^a   Podolskii, Vladimir ^b   Zakharyaschev, Michael ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

CIRCUIT COMPLEXITY; CONJUNCTIVE QUERIES; FIRST ORDER; LOWER BOUNDS; MONOTONE BOOLEAN FUNCTIONS; NON-RECURSIVE DATALOG; QUERY REWRITINGS;

BOOLEAN ALGEBRA;

EID: 84884192065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_26     Document Type: Conference Paper

References (27)

1. Acciarri, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Palmieri, M., Rosati, R.: QuOnto: Querying ontologies. In: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), pp. 1670-1671 (2005)
2. Alon, N., Boppana, R.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1-22 (1987)
3. Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)
4. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. of Artificial Intelligence Research (JAIR) 36, 1-69 (2009)
5. Avigad, J.: Eliminating definitions and Skolem functions in first-order logic. In: Proc. of LICS, pp. 139-146 (2001)
6. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.(eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press (2003)
7. Benedikt, M., Gottlob, G.: The impact of virtual views on containment. PVLDB 3(1), 297-308 (2010)
8. Borodin, A., von zur Gathen, J., Hopcroft, J.E.: Fast parallel matrix and gcd computations. In: Proc. of FOCS, pp. 65-71 (1982)
9. Cal̀?, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77-86 (2009)
10. Cal̀?, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554-565 (2010)
11. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3), 385-429 (2007)
12. Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: Proc. of the IEEE Int. Conf. on Data Engineering, ICDE (2011)
13. Gottlob, G., Schwentick, T.: Rewriting ontological queries into small nonrecursive Datalog programs. In: Proc. of DL 2011, vol. 745. CEUR-WS.org (2011)
14. Jukna, S.: Boolean Function Complexity: Advances and Frontiers. Springer (2012)
15. Kikot, S., Kontchakov, R., Zakharyaschev, M.: On (in)tractability of OBDA with OWL 2 QL. In: Proc. of DL 2011, vol. 745. CEUR-WS.org (2011)
16. Kikot, S., Kontchakov, R., Zakharyaschev, M.: Conjunctive query answering with OWL 2 QL. In: Proc. of the 13th Int. Conf. KR 2012. AAAI Press (2012)
17. Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: Proc. of the 12th Int. Conf. KR 2010. AAAI Press (2010)
18. Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic EL using a relational database system. In: Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, IJCAI 2009, pp. 2070-2075 (2009)
19. Perez-Urbina, H., Motik, B., Horrocks, I.: A comparison of query rewriting techniques for DL-Lite. In: Proc. of DL 2009, vol. 477. CEUR-WS.org (2009)
20. Raz, R., McKenzie, P.: Separation of the monotone NC hierarchy. In: Proc. of FOCS, pp. 234-243 (1997)
21. Raz, R., Wigderson, A.: Monotone circuits for matching require linear depth. J. ACM 39(3), 736-744 (1992)
22. Razborov, A.: Lower bounds for the monotone complexity of some Boolean functions. Dokl. Akad. Nauk SSSR 281(4), 798-801 (1985)
23. Rodrguez-Muro, M., Calvanese, D.: Dependencies to optimize ontology based data access. In: Proc. of DL 2011, vol. 745. CEUR-WS.org (2011)
24. Rodrguez-Muro, M., Calvanese, D.: Semantic index: Scalable query answering without forward chaining or exponential rewritings. In: Proc. of the 10th Int. Semantic Web Conf., ISWC (2011)
25. Rodrguez-Muro, M., Calvanese, D.: High performance query answering over DLLite ontologies. In: Proc. of the 13th Int. Conf. KR 2012. AAAI Press (2012)
26. Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: Proc. of the 12th Int. Conf. KR 2010. AAAI Press (2010)
27. Tseitin, G.: On the complexity of derivation in propositional calculus. In: Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970 (1983)