Decomposing quantified conjunctive (or disjunctive) formulas
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 144
- Type
- D - Journal article
- DOI
-
10.1137/140957378
- Title of journal
- SIAM Journal on Computing
- Article number
- -
- First page
- 2066
- Volume
- 45
- Issue
- 6
- ISSN
- 0097-5397
- Open access status
- Technical exception
- Month of publication
- November
- Year of publication
- 2016
- URL
-
http://eprints.bbk.ac.uk/id/eprint/22144/
- 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)
-
3 - Knowledge Representation and Data Management
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper proves a complexity classification theorem on quantified conjunctive formulas, one of the first systematic classification theorems on a formula class that generalises conjunctive queries. The paper contains elements that led to H. Chen's 2017 Journal of the ACM paper "The Tractability Frontier of Graph-Like First-Order Query Sets". The relationship between the two papers is discussed in the latter paper.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -