Parity Games and Propositional Proofs
- Submitting institution
-
Swansea University / Prifysgol Abertawe
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 17523
- Type
- D - Journal article
- DOI
-
10.1145/2579822
- Title of journal
- ACM Transactions on Computational Logic
- Article number
- -
- First page
- 17:1
- Volume
- 15
- Issue
- 2
- ISSN
- 1529-3785
- Open access status
- Out of scope for open access requirements
- Month of publication
- April
- Year of publication
- 2014
- 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
-
-
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The question whether parity games can be solved in polynomial-time is a long-standing open problem in Theoretical Computer Science. Another fundamental open question asks whether proof search for propositional resolution is feasible. This paper connects these two questions by showing that proof-search for resolution is at least as hard as solving Parity Games. To this end, the paper presents a general technique for producing polynomial sized resolution proofs which is of general interest. Results immediately picked-up by key researchers in area, e.g.: Atserias, The Proof-Search Problem, SAT 2013, LNCS7962, 2013, 1-17.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -