Queries with negation and inequalities over lightweight ontologies
- Submitting institution
-
Cardiff University / Prifysgol Caerdydd
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 104817358
- Type
- D - Journal article
- DOI
-
10.1016/j.websem.2015.06.002
- Title of journal
- Journal of Web Semantics
- Article number
- -
- First page
- 184
- Volume
- 35
- Issue
- 4
- ISSN
- 1570-8268
- Open access status
- Out of scope for open access requirements
- Month of publication
- June
- Year of publication
- 2015
- URL
-
http://dx.doi.org/10.1016/j.websem.2015.06.002
- 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
-
3
- Research group(s)
-
A - Artificial intelligence and data analytics
- Citation count
- 11
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- In this paper we close a long-standing open problem regarding the computational complexity of answering conjunctive queries with negated atoms mediated by description logic ontologies. Our results have served as a starting point of a research line seeking both syntactic and semantics restrictions on the use of negation in queries, e.g., https://doi.org/10.1609/aaai.v34i03.5666, https://doi.org/10.1007/978-3-030-19570-0_24, for data integration (https://doi.org/10.1007/978-3-319-61893-7_11), and for OBDA under the bag semantics (https://doi.org/10.1016/j.artint.2019.02.003).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -