Suggestions in Courses
See all course resultsSuggestions in News
- No suggestions found.
Suggestions in Events
See all events results
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.
Kikot, Stanislav, Kurucz, Agi, Tanaka, Yoshihito, Wolter, Frank and Zakharyaschev, Michael (2019) Kripke completeness of strictly positive modal logics over meet-semilattices with operators. Journal of Symbolic Logic, 84 (02). pp. 533-588. ISSN 0022-4812
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, 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.
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
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.
![[up]](/style/images/multi_up.png)
Up a level