Parameterised Resource-Bounded ATL

Publication date

2020-06-16

Authors

Alechina, NatashaORCID 0000-0003-3306-9891ISNI 0000000124421545
Demri, Stephane
Logan, BrianORCID 0000-0003-0648-7107ISNI 0000000124462996

Editors

Advisors

Supervisors

Document Type

Part of book
Open Access logo

License

taverne

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.

Keywords

Taverne

Citation

Alechina, N A, Demri, S & Logan, B S 2020, Parameterised Resource-Bounded ATL. in Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020. vol. 34, AAAI Press, pp. 7040-7046. https://doi.org/10.1609/aaai.v34i05.6189