Resource-bounded ATL: the Quest for Tractable Fragments

Abstract : Resource-aware logics to represent strategic abilities in multi-agent systems are notoriously hard to handle as they combine strategic reasoning with reasoning about resources. In this work, we begin by providing a general overview of the model-checking results currently available for the Resource-bounded Alternating-time Temporal Logic RB±ATL. This allows us to identify several open problems in the literature, as well as to establish relationships with RBTL-like logics, when RB±ATL is restricted to a single agent. Then, we tackle one such open problem that we deem highly significant: we show that model checking RB±ATL is ptime-complete when restricted to a single agent and a single resource. To do so, we make a valuable detour on vector addition systems with states, by proving new complexity results for their state-reachability and nontermination problems, when restricted to a single counter. Thus, reasoning about resources comes at no computational extra cost in the single-resource, single-agent case.
Document type :
Conference papers
Complete list of metadatas
Contributor : Stéphane Demri <>
Submitted on : Thursday, November 14, 2019 - 7:51:42 AM
Last modification on : Monday, November 18, 2019 - 7:52:26 PM


  • HAL Id : hal-02362636, version 1


Francesco Belardinelli, Stephane Demri. Resource-bounded ATL: the Quest for Tractable Fragments. 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019, May 2019, Montreal, Canada. pp.206--214. ⟨hal-02362636⟩



Record views