Parameterised Resource-Bounded ATL

Natasha Alechina; Stephane Demri; Brian Logan

doi:10.1609/aaai.v34i05.6189

Parameterised Resource-Bounded ATL

Natasha Alechina, Stephane Demri, Brian Logan

Research output: Chapter in Book/Report/Conference proceeding › Conference Article in proceeding › Academic › peer-review

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.

Original language	English
Title of host publication	Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020
Pages	7040-7046
ISBN (Electronic)	9781577358350
DOIs	https://doi.org/10.1609/aaai.v34i05.6189
Publication status	Published - 16 Jun 2020
Externally published	Yes

Access to Document

10.1609/aaai.v34i05.6189

Cite this

@inproceedings{63c21e10b92a4bc2a55ae44755f6c521,

title = "Parameterised Resource-Bounded ATL",

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.",

author = "Natasha Alechina and Stephane Demri and Brian Logan",

year = "2020",

month = jun,

day = "16",

doi = "10.1609/aaai.v34i05.6189",

language = "English",

isbn = "978-1-57735-835-0",

pages = "7040--7046",

booktitle = "Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020",

}

TY - GEN

T1 - Parameterised Resource-Bounded ATL

AU - Alechina, Natasha

AU - Demri, Stephane

AU - Logan, Brian

PY - 2020/6/16

Y1 - 2020/6/16

N2 - 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.

AB - 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.

U2 - 10.1609/aaai.v34i05.6189

DO - 10.1609/aaai.v34i05.6189

M3 - Conference Article in proceeding

SN - 978-1-57735-835-0

SP - 7040

EP - 7046

BT - Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020

ER -

Parameterised Resource-Bounded ATL

Abstract

Access to Document

Fingerprint

Cite this