Finite open-world query answering with number restrictions
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 10415
- Type
- D - Journal article
- DOI
-
10.1145/3365834
- Title of journal
- ACM Transactions on Computational Logic
- Article number
- 27
- First page
- -
- Volume
- 21
- Issue
- 4
- ISSN
- 1529-3785
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2020
- 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
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Many standard database constraints can be modeled as single-attribute referential constraints (in formal terms, Unary inclusion dependencies or UIDs), and functional dependencies (FDs). This paper, extending a LICS 2015 conference version, shows that entailment of a conjunctive query from a collection of facts, UIDs, and FDs is decidable and is coNP-complete, when only finite models are considered in the entailment. Even decidability was open prior to this. The paper introduces a number of new techniques for showing decidability over finite models, and one of the authors was awarded the Beth Prize for outstanding thesis for results based in the paper.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -