Items where Author is "Podolskii, Vladimir"

Group by: Item Type | No Grouping
Number of items: 6.

Article

Bienvenu, Meghyn, Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir and Zakharyaschev, Michael (2018) Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity. Journal of the ACM, 65 (5). pp. 1-51. ISSN 0004-5411

Bienvenu, Meghyn, Kikot, Stanislav and Podolskii, Vladimir (2015) Tree-like queries in OWL 2 QL: succinctness and complexity results. Proceedings of LICS 2015: 30th Annual ACM/IEEE Symposium on Logic in Computer Science,. pp. 317-328.

Gottlob, Georg, Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir, Schwentick, Thomas and Zakharyaschev, Michael (2014) The price of query rewriting in ontology-based data access. Artificial Intelligence, 213. pp. 42-59. ISSN 0004-3702

Monograph

Gerasimova, Olga, Kikot, Stanislav, Kurucz, Agi, Podolskii, Vladimir and Zakharyaschev, Michael (2020) A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom. Technical Report. International Joint Conferences on Artificial Intelligence Organization.

Conference or Workshop Item

Bienvenu, Meghyn, Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir, Ryzhikov, Vladislav and Zakharyaschev, Michael (2017) The complexity of ontology-based data access with OWL 2 QL and bounded treewidth queries. In: PODS 2017, 14-19 May 2017, Chicago, Illinois, United States.

Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir and Zakharyaschev, Michael (2014) On the succinctness of query rewriting over shallow ontologies. In: CSL/LICS 2014: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, 14- 18 July 2014, Vienna, Austria.

This list was generated on Sat Dec 21 22:32:02 2024 UTC.