The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1234567
- Type
- E - Conference contribution
- DOI
-
10.1145/3034786.3034791
- Title of conference / published proceedings
- Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '17
- First page
- 201
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- May
- Year of publication
- 2017
- URL
-
https://dl.acm.org/doi/10.1145/3034786.3034791
- Supplementary information
-
https://arxiv.org/pdf/1702.03358.pdf
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
3 - Knowledge Representation and Data Management
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is a significant contribution to the theory of ontology-based data access, establishing important results on the complexity of answering ontology-mediated queries with OWL 2 QL ontologies. To the best of our knowledge, it is the first paper to investigate the parameterised complexity of ontology-mediated query answering. PODS is the premier database theory conference. An extended full version is available at https://arxiv.org/pdf/1702.03358.pdf.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
