The Tractability Frontier of Graph-Like First-Order Query Sets
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 145
- Type
- D - Journal article
- DOI
-
10.1145/3073409
- Title of journal
- Journal of the ACM
- Article number
- -
- First page
- 1
- Volume
- 64
- Issue
- 4
- ISSN
- 000-45411
- Open access status
- Technical exception
- Month of publication
- August
- Year of publication
- 2017
- URL
-
http://eprints.bbk.ac.uk/id/eprint/30798/
- 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
-
0
- Research group(s)
-
3 - Knowledge Representation and Data Management
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper proves the first complexity classification theorem on general first-order formulas, a landmark result. Among other contributions, this paper introduces a framework for dealing with the complexity of restricted query sets; an extension of this framework was used to obtain a major classification theorem published by H. Chen and S. Mengel in PODS 2016. This classification theorem generalises and unifies a number of previous celebrated theorems.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -