Conjunctive query answering with OWL 2 QL

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2012, Pages 275-285

  Kikot, Stanislav ^a   Kontchakov, Roman ^a   Zakharyaschev, Michael ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ONTOLOGY;

CONJUNCTIVE QUERIES; POLYNOMIAL SIZE;

KNOWLEDGE REPRESENTATION;

EID: 84893409164     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Abiteboul, S.; Hull, R.; and Vianu, V. 1995. Foundations of Databases. Addison-Wesley.
2. Baader, F.; Calvanese, D.; McGuinness, D.; Nardi, D.; and Patel-Schneider, P., eds. 2003. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press.
3. Baader, F.; Brandt, S.; and Lutz, C. 2005. Pushing the EL envelope. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, IJCAI-05, 364-369. Professional Book Center.
4. Baader, F.; Brandt, S.; and Lutz, C. 2008. Pushing the EL envelope further. In Clark, K., and Patel-Schneider, P. F, eds., Proc. of the OWLED 2008 DC Workshop on OWL: Experiences and Directions.
5. Borodin, A.; von zur Gathen, J.; and Hopcroft, J. E. 1982. Fast parallel matrix and GCD computations. In Proc. of the 23rd Annual Symp. on Foundations of Computer Science, FOCS'82, 65-71. IEEE Computer Society.
6. Calvanese, D.; De Giacomo, G; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007a. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3):385-429.
7. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; Poggi, A.; and Rosati, R. 2007b. Ontology-based database access. In Proc. of the 15th Ital. Conf. on Database Systems, SEBD 2007, 324-331.
8. Chortaras, A.; Trivela, D.; and Stamou, G. 2011. Goal-oriented query rewriting for OWL 2 QL. In Proc. of the 24th Int. Workshop on Description Logics, DL 2011, Vol. 745 of CEUR Workshop Proceedings. CEUR-WS.org.
9. Gottlob, G., and Schwentick, T. 2011. 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.
10. Gottlob, G.; Orsi, G.; and Pieris, A. 2011. Ontological queries: Rewriting and optimization. In Proc. of the the 27th Int. Conf. on Data Engineering, ICDE 2011, 2-13. IEEE Computer Society.
11. Kikot, S.; Kontchakov, R.; and Zakharyaschev, M. 2011. 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.
12. Kikot, S.; Kontchakov, R.; Podolskii, V.; and Zakhary-aschev, M. 2012. Exponential lower bounds and separation for query rewriting. CoRR, arXiv:1202.4193, 2012.
13. Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2010. The combined approach to query answering in DL-Lite. In Proc. of the 12th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2010. AAAI Press.
14. Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2011. The combined approach to ontology-based data access. In Proc. of the 20th Int. Joint Conf. on Artificial Intelligence, IJCAI-2011, 2656-2661. AAAI Press.
15. Lenzerini, M. 2002. Data integration: A theoretical perspective. In Proc. of the 21st ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, PODS 2002, 233-246.
16. Lutz, C.; Toman, D.; and Wolter, F. 2009. 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, 2070-2075. AAAI Press.
17. Pérez-Urbina, H.; Motik, B.; and Horrocks, I. 2009. A comparison of query rewriting techniques for DL-Lite. In Int. Workshop on Description Logics, DL 2009, Vol. 477 of CEUR Workshop Proceedings. CEUR-WS.org.
18. Raz, R., and McKenzie, P. 1997. Separation of the monotone nc hierarchy. In Proc. of the 38th Annual Symp. on Foundations of Computer Science, FOCS'97, 234-243. IEEE Computer Society.
19. Raz, R., and Wigderson, A. 1992. Monotone circuits for matching require linear depth. J. ACM 39(3):736-744.
20. Razborov, A. 1985. Lower bounds for the monotone complexity of some Boolean functions. Dokl. Akad. Nauk SSSR 281(4):798-801.
21. Rodriguez Muro, M., and Calvanese, D. 2011a. Dependencies to optimize ontology based data access. In Proc. of the 24th Int. Workshop on Description Logics, DL 2011, Vol. 745 of CEUR Workshop Proceedings. CEUR-WS.org.
22. Rodriguez Muro, M., and Calvanese, D. 2011b. Semantic index: Scalable query answering without forward chaining or exponential rewritings. In Proc. of the 10th Int. Semantic Web Conf., ISWC 2011.
23. Rosati, R., and Almatelli, A. 2010. Improving query answering over DL-Lite ontologies. In Proc. of the 12th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2010. AAAI Press.