Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 209
- Type
- D - Journal article
- DOI
-
10.1145/3191832
- Title of journal
- Journal of the ACM
- Article number
- -
- First page
- 28:1
- Volume
- 65
- Issue
- 5
- ISSN
- 0004-5411
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2018
- URL
-
http://eprints.bbk.ac.uk/id/eprint/22094/
- Supplementary information
-
-
- 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
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- By establishing a connection between ontology-based data access (OBDA) and circuit complexity, this paper gives complete solutions to the succinctness problem for the size of first-order rewritings and the complexity problem of answering ontology-mediated queries. Apart from solving fundamental theoretical problems in OBDA, the paper informs OBDA practitioners of the efficiency they can expect from their ontologies and queries.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -