Parameterised Resource-Bounded ATL

Natasha Alechina, Stéphane Demri, Brian Logan

AAAI 2020 pp. 7040-7046

doi:10.1609/AAAI.V34I05.6189 /aaai/2020/alechina2020aaai-parameterised/

Abstract

It is often advantageous to be able to extract resource requirements in resource logics of strategic ability, rather than to verify whether a fixed resource requirement is sufficient for achieving a goal. We study Parameterised Resource-Bounded Alternating Time Temporal Logic where parameter extraction is possible. We give a parameter extraction algorithm and prove that the model-checking problem is 2EXPTIME-complete.

PDF AAAI Semantic Scholar

Cite

Text

Alechina et al. "Parameterised Resource-Bounded ATL." AAAI Conference on Artificial Intelligence, 2020. doi:10.1609/AAAI.V34I05.6189

Markdown

[Alechina et al. "Parameterised Resource-Bounded ATL." AAAI Conference on Artificial Intelligence, 2020.](https://mlanthology.org/aaai/2020/alechina2020aaai-parameterised/) doi:10.1609/AAAI.V34I05.6189

BibTeX

@inproceedings{alechina2020aaai-parameterised,
  title     = {{Parameterised Resource-Bounded ATL}},
  author    = {Alechina, Natasha and Demri, Stéphane and Logan, Brian},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2020},
  pages     = {7040-7046},
  doi       = {10.1609/AAAI.V34I05.6189},
  url       = {https://mlanthology.org/aaai/2020/alechina2020aaai-parameterised/}
}