?
On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom
Ch. 19. P. 1-12.
Gerasimova O., Подольский В. В., Kikot S., Zakharyaschev M.
Ключевые слова: дескриптивная логикаОнтологический доступ к даннымOntology-based data accessDescription logics
ПУБЛИКАЦИЯ ПОДГОТОВЛЕНА ПО РЕЗУЛЬТАТАМ ПРОЕКТА:
В книге
Aachen : CEUR Workshop Proceedings, 2017
Герасимова О. А., 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 г.
Aachen : CEUR Workshop Proceedings, 2018
The DL workshop is the major annual event of the description logic research community. It is the forum at which those interested in description logics, both from academia and industry, meet to discuss ideas, share information and compare experiences. ...
Добавлено: 22 октября 2018 г.
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 г.
Герасимова О. А., 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 г.
Герасимова О. А., 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 г.
Zakharyaschev M. et al., International Journal of Applied Mathematics and Computer Science 2019 Vol. 29 No. 1 P. 17-30
Добавлено: 6 июня 2019 г.
Подольский В. В., Захарьящев М. В., Bienvenu M. и др., , in : Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. * F127745.: ACM, 2017. P. 201-216.
Добавлено: 17 сентября 2017 г.
Объедков С. А., Sertkaya B., Zolotukhin D., , in : 32nd International Workshop on Description Logics, DL 2019; Oslo; Norway; 18 June 2019 through 21 June 2019. : CEUR-WS.org, 2019. P. 1-10.
Добавлено: 29 октября 2019 г.
Захарьящев М. В., Kontchakov R., Ryzhikov V. и др., The International Joint Conference on Artificial Intelligence (IJCAI), 2020
Добавлено: 6 ноября 2021 г.
CEUR Workshop Proceedings, 2015
Добавлено: 19 октября 2016 г.
Захарьящев М. В., Ryzhikov V., Wałęga P., Springer Publishing Company, 2020
Добавлено: 8 ноября 2021 г.
Berlin, Heidelberg : Springer, 2009
This book constitutes the refereed proceedings of the 17th International Conference on Conceptual Structures, ICCS 2009, which took place in Moscow, Russia, on July 26-31, 2009.
The 18 papers presented together with 5 invited contributions were carefully reviewed and selected from approximately 50 submissions. Originally centered around research on knowledge representation and reasoning with conceptual graphs, ...
Добавлено: 9 декабря 2012 г.