The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries-Reference-Cited by-同舟云学术

The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries

Published:2017-05-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Bienvenu Meghyn¹,Kikot Stanislav²,Kontchakov Roman²,Podolskii Vladimir V.³,Ryzhikov Vladislav⁴,Zakharyaschev Michael⁵

Affiliation:

1. CNRS & University of Montpellier, Montpellier, France

2. Birkbeck, University of London, London, United Kingdom

3. Steklov Mathematical Institute & National Research University Higher School of Economics, Moscow, Russian Fed.

4. Free University of Bozen-Bolzano, Bozen-Bolzano, Italy

5. Birkbeck, University of London, Lodnon, United Kingdom

Funder

Engineering and Physical Sciences Research Council

Agence Nationale de la Recherche

Publisher

ACM

Link

Reference63 articles.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

4. Ontology-Mediated Queries;Journal of the ACM;2018-09-18

5. Evaluation of Query Transformations without Data;Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18;2018