On the complexity of resource-bounded logics
- Submitting institution
-
University of Nottingham, The
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1334784
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2018.01.019
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 69
- Volume
- 750
- Issue
- -
- ISSN
- 0304-3975
- Open access status
- Compliant
- Month of publication
- February
- Year of publication
- 2018
- 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
-
3
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- It is frequently useful to be able to be able to determine the minimal amount of resources necessary to achieve a goal in strategic settings. This paper is significant because it shows how techniques from alternating vector addition systems with states can be applied to logics of strategic ability with resources to compute the Pareto optimal set of initial resource requirements for a strategy. It also provides tight computational complexity results for a number of resource logics where either no complexity bounds were known, or only loose lower and upper bounds were established.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
