Parameterised Resource-Bounded ATL

Alechina, Natasha; Demri, St�phane; Logan, Brian

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.

Citation

Alechina, N., Demri, S., & Logan, B. (2020). Parameterised Resource-Bounded ATL. In Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (7040-7046). https://doi.org/10.1609/aaai.v34i05.6189

• Conference Name: Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20)
• Conference Location: New York, NY, USA
• Start Date: Feb 7, 2020
• End Date: Feb 12, 2020
• Acceptance Date: Nov 21, 2019
• Online Publication Date: Apr 3, 2020
• Publication Date: Apr 3, 2020
• Deposit Date: May 31, 2020
• Publicly Available Date: Jul 22, 2020
• Volume: 34
• Pages: 7040-7046
• Series ISSN: 2374-3468
• Book Title: Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence
• ISBN: 978-1-57735-835-0
• DOI: https://doi.org/10.1609/aaai.v34i05.6189
• Public URL: https://nottingham-repository.worktribe.com/output/3689235
• Publisher URL: https://aaai.org/ojs/index.php/AAAI/article/view/6189
• Related Public URLs: https://aaai.org/Conferences/AAAI-20/; https://aaai.org/Library/AAAI/aaai20contents.php
• Additional Information: Copyright to individual papers as well as the proceedings as a whole is fully owned by the Association for the Advancement of Artificial Intelligence.