RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Commun. Comput. Inf. Sci., 2017, Volume 786, Pages 143–158 (Mi ccis1)  

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

O. A. Gerasimovaa, S. P. Kikotb, V. V. Podolskiica, M. Zakharyaschevb

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

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.


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

Full text: https:/.../978-3-319-69548-8_11

Bibliographic databases:

Language:

Linking options:
  • http://mi.mathnet.ru/eng/ccis1

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:36

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020