|
|
|
Publications in Math-Net.Ru |
Citations |
|
2018 |
| 1. |
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), 028, 51 pp.     |
14
|
|
2016 |
| 2. |
M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries”, CEUR Workshop Proceedings, 1577 (2016), 0  |
|
2015 |
| 3. |
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results”, LICS, 2015, 317–328 |
6
|
|
2014 |
| 4. |
M. Bienvenu, S. Kikot, V. Podolskii, “Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries”, CEUR Workshop Proceedings, 1193 (2014), 45–57 |
|
| Organisations |
|
|
Contact us: