?
The complexity of ontology-based data access with OWL2QL and bounded treewidth queries
P. 201–216.
Подольский В. В., Захарьящев М. В., Bienvenu M., Kikot S., Ryzhikov V., Kontchakov R.
Ключевые слова: query rewritingOntology-based data accesscombined complexityOntology-mediated queryParameterised complexity
ПУБЛИКАЦИЯ ПОДГОТОВЛЕНА ПО РЕЗУЛЬТАТАМ ПРОЕКТА:
В книге
* F127745. , ACM, 2017.
Герасимова О. А., Kikot S., Подольский В. В. и др., Artificial Intelligence 2022 Vol. 309 Article 103738
Our concern is the problem of efficiently determining the data complexity of answering queries mediated by description logic ontologies and constructing their optimal rewritings to standard database queries. Originated in ontology-based data access and datalog optimisation, this problem is known to be computationally very complex in general, with no explicit syntactic characterisations available. In this ...
Добавлено: 30 мая 2022 г.
Захарьящев М. В., Ryzhikov V., Wałęga P., Springer Publishing Company, 2020.
Добавлено: 8 ноября 2021 г.
Artale A., Kontchakov R., Kovtunova A. и др., Artificial Intelligence 2021 Vol. 299 Article 103536
Добавлено: 30 сентября 2021 г.
Герасимова О. А., Kikot S., Kurucz A. и др., , in: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning.: The International Joint Conference on Artificial Intelligence (IJCAI), 2020. P. 403–413.
Добавлено: 9 октября 2020 г.
Zakharyaschev M. et al., International Journal of Applied Mathematics and Computer Science 2019 Vol. 29 No. 1 P. 17–30
Добавлено: 6 июня 2019 г.
Герасимова О. А., Kikot S., Захарьящев М. В., , in: Proceedings of the 31th International Workshop on Description Logics, Tempe, Arizona, October 27-29, 2018.: Aachen: CEUR Workshop Proceedings, 2018. P. 1–13.
Добавлено: 22 октября 2018 г.
Герасимова О. А., Kikot S., Подольский В. В. и др., , in: Proceedings of the 8th international Conference on Knowledge Engineering and Semantic Web.: Berlin: Springer, 2017. P. 143–158.
This paper reports on our ongoing work that aims at a classification of conjunctive queries q according to the data complexity of answering ontology-mediated queries (A -> T v F, q). We give examples of queries from the complexity classes C in {AC0, L, NL, P, coNP}, and obtain a few syntactical conditions for C-membership ...
Добавлено: 3 декабря 2017 г.
Gerasimova O., Подольский В. В., Kikot S. и др., , in: Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017.: Aachen: CEUR Workshop Proceedings, 2017. Ch. 19 P. 1–12.
Добавлено: 27 июля 2017 г.
Aachen: CEUR Workshop Proceedings, 2017.
The International Workshop on Description Logics is the main annual event of the Description Logic research community. It is the forum at which those interested in description logics, from both academia and industry, meet to discuss ideas, share information, and compare experiences. The workshop explicitly welcomes submissions from researchers that are new to the area ...
Добавлено: 27 июля 2017 г.
Bienvenu M., Kikot S., Подольский В. В., , in: Description Logics Workshop, Proceedings of the 28th International Workshop on Description Logics, Athens, Greece, June 7th to 10th, 2015.Vol. 1350.: CEUR Workshop Proceedings, 2015. P. 1–4.
Добавлено: 19 октября 2016 г.
Gottlob G., Kikot S., Kontchakov R. и др., Artificial Intelligence 2014 Vol. 213 P. 42–59
Добавлено: 24 марта 2015 г.
Kikot S., Kontchakov R., Подольский В. В. и др., , in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).: NY: ACM, 2014. P. 1–10.
Добавлено: 20 октября 2014 г.
Gottlob G., Kikot S., Kontchakov R. и др., Artificial Intelligence 2014 Vol. 213 P. 42–59
We give a solution to the succinctness problem for the size of first-order rewritings of conjunctive queries in ontologybased data access with ontology languages such as OWL2QL, linear Datalog and sticky Datalog. We show that positive existential and nonrecursive datalog rewritings, which do not use extra non-logical symbols (except for intensional predicates in the case ...
Добавлено: 20 октября 2014 г.
Bienvenu M., Kikot S., Подольский В. В., , in: CEUR Workshop ProceedingsVol. 1193: Informal Proceedings of the 27th International Workshop on Description Logics. Vienna, Austria, July 17-20, 2014.: Wien: CEUR Workshop Proceedings, 2014. P. 45–57.
Добавлено: 20 октября 2014 г.