Logic in Computer Science
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

Logic in Computer Science, 2015, Pages 317–328
DOI: https://doi.org/10.1109/LICS.2015.38 (Mi lics1) 		 
This article is cited in 6 scientific papers (total in 6 papers)

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results

Meghyn Bienvenua, Stanislav Kikotbc, Vladimir V. Podolskiide

a Laboratoire de Recherche en Informatique, CNRS & Université Paris-Sud, Orsay, France
b Institute for Information Transmission Problems, Moscow, Russia
c MIPT, Moscow, Russia
d Steklov Mathematical Institute, Moscow, Russia
e National Research University Higher School of Economics, Moscow, Russia
Citations (6)
DOI: https://doi.org/10.1109/LICS.2015.38
Funding agency Grant number
Agence Nationale de la Recherche 12-JS02-007-01
Russian Foundation for Basic Research
Ministry of Education and Science of the Russian Federation
Russian Science Foundation 14-50-00150
M. Bienvenu was supported by the ANR (project 12-JS02-007-01), and V. Podolskii by the Russian Foundation for Basic Research and the programme "Leading Scientific Schools". S. Kikot carried out his research at IITP at the expense of the Russian Foundation for Sciences (project No. 14-50-00150).
Bibliographic databases:
Document Type: Article
Language: English
Linking options:
  • https://www.mathnet.ru/eng/lics1
    • Related presentations:
    This publication is cited in the following 6 articles:
    1. Ping Lu, Ting Deng, Haoyuan Zhang, Yufeng Jin, Feiyi Liu, Tiancheng Mao, Lexiao Liu, 2024 IEEE 40th International Conference on Data Engineering (ICDE), 2024, 382  crossref
    2. 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), 28–51  mathnet  crossref  isi  scopus
    3. Edward Stabler, Lecture Notes in Computer Science, 10686, Formal Grammar, 2018, 72  crossref
    4. Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 61:2 (2017), 464–493  mathnet  crossref  isi  scopus
    5. Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017, 201  crossref
    6. Meghyn Bienvenu, Magdalena Ortiz, Lecture Notes in Computer Science, 9203, Reasoning Web. Web Logic Rules, 2015, 218  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:196
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025