The Data Complexity of Ontology-Mediated Queries with Closed Predicates
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12137
- Type
- D - Journal article
- DOI
-
10.23638/LMCS-15(3:23)2019
- Title of journal
- Logical Methods in Computer Science
- Article number
- 23
- First page
- 2019
- Volume
- 15
- Issue
- 3
- ISSN
- 1860-5974
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2019
- URL
-
-
- 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
-
2
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This journal paper combines and extends the conference papers "Ontology-Based Data Access with Closed Predicates is Inherently Intractable (Sometimes)" (IJCAI'13) and "Ontology-Mediated Queries with Closed Predicates" (IJCAI'15), both by the same authors and not REF returned. The conference papers initiated the systematic study of the complexity of mixing open and closed world predicates in ontology-based data management and strongly influenced subsequent work by research groups at, for example, CNRS (Bienvenu, Bourhis), Dresden (Borgwardt), Oxford (Benedikt), and Vienna (Ortiz, Simkus).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -