O. A. Gerasimova, S. P. Kikot, V. V. Podolskii, M. Zakharyaschev, “More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom”, Communications in Computer and Information Science, 2017, Volume 786, Pages 143

Communications in Computer and Information Science

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Communications in Computer and Information Science, 2017, Volume 786, Pages 143–158
DOI: https://doi.org/10.1007/978-3-319-69548-8_11 (Mi ccis1)

This article is cited in 3 scientific papers (total in 3 papers)

More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom

O. A. Gerasimova^a, S. P. Kikot^b, V. V. Podolskii^ca, M. Zakharyaschev^b

^a National Research University Higher School of EconomicsMoscowRussia
^b Birkbeck, University of London
^c Steklov Mathematical Institute, Moscow, Russia

Full-text PDF Citations (3)

DOI: https://doi.org/10.1007/978-3-319-69548-8_11

Funding agency	Grant number
Russian Science Foundation	17-11-01294
Ministry of Education and Science of the Russian Federation	MK-7312.2016.1
The work of O. Gerasimova and M. Zakharyaschev was carried out at the National Research University Higher School of Economics and supported by the Russian Science Foundation under grant 17-11-01294; the work of V. Podolskii was supported by the Russian Academic Excellence Project ‘5-100’ and by grant MK7312.2016.1.

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

https://www.mathnet.ru/eng/ccis1

This publication is cited in the following 3 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	82