|
|
|
Публикации в базе данных Math-Net.Ru |
Цитирования |
|
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 стр.     |
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),  |
|
2014 |
| 3. |
G. Gottlob, S. Kikot, R. Kontchakov, V. Podolskii, T. Schwentick, M. Zakharyaschev, “The price of query rewriting in ontology-based data access”, Artif. Intell., 213 (2014), 42–59  |
41
|
|
2013 |
| 4. |
S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Query Rewriting over Shallow Ontologies”, CEUR Workshop Proceedings, 1014 (2013), 316–327 |
|
2012 |
| 5. |
S. Kikot, R. Kontchakov, V. V. Podolskii, M. Zakharyaschev, “Exponential lower bounds and separation for query rewriting”, Lecture Notes in Comput. Sci., 7392 (2012), 263–274 |
20
|
|
Обратная связь: