20 citations to https://www.mathnet.ru/eng/lncs12
-
Stanislav Kikot, Roman Kontchakov, Salvatore Rapisarda, Michael Zakharyaschev, Lecture Notes in Computer Science, 11230, On the Move to Meaningful Internet Systems. OTM 2018 Conferences, 2018, 441
-
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity”, Journal of the ACM, 65:5 (2018), 28–51
-
Evgeny Kharlamov, Dimitris Bilidas, Dag Hovland, Ernesto Jimenez-Ruiz, Davide Lanti, Hallstein Lie, Martin Rezk, Martin G. Skjjveland, Ahmet Soylu, Guohui Xiao, Dimitriy Zheleznyakov, Martin Giese, Yannis Ioannidis, Yannis Kotidis, Manolis Koubarakis, Arild Waaler, “Ontology Based Data Access in Statoil”, SSRN Journal, 2017
-
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017, 201
-
Davide Lanti, Guohui Xiao, Diego Calvanese, Lecture Notes in Computer Science, 10587, The Semantic Web – ISWC 2017, 2017, 452
-
Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 61:2 (2017), 464–493
-
Birte Glimm, Yevgeny Kazakov, Trung-Kien Tran, Lecture Notes in Computer Science, 9898, Web Reasoning and Rule Systems, 2016, 77
-
Dag Hovland, Davide Lanti, Martin Rezk, Guohui Xiao, Lecture Notes in Computer Science, 9718, Rule Technologies. Research, Tools, and Applications, 2016, 269
-
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results”, LICS, 2015, 317–328
-
Meghyn Bienvenu, Magdalena Ortiz, Lecture Notes in Computer Science, 9203, Reasoning Web. Web Logic Rules, 2015, 218