Resource-bounded ATL : the Quest for Tractable Fragments En quête de fragments mécanisables pour ATL avec ressources Keywords Logics for agents and multi-agent systems, verification techniques for multi-agent systems, model-checking, vec- tor addition systems with states

Abstract : 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 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 nontermina-tion problems, when restricted to a single counter. This paper has been presented at the conference AAMAS'19,
Document type :
Conference papers
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02328812
Contributor : Jérôme Lang <>
Submitted on : Wednesday, October 23, 2019 - 12:37:42 PM
Last modification on : Monday, November 18, 2019 - 6:57:11 PM
Long-term archiving on: Friday, January 24, 2020 - 5:20:59 PM

File

cnia12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02328812, version 1

Citation

Francesco Belardinelli, Stephane Demri. Resource-bounded ATL : the Quest for Tractable Fragments En quête de fragments mécanisables pour ATL avec ressources Keywords Logics for agents and multi-agent systems, verification techniques for multi-agent systems, model-checking, vec- tor addition systems with states. Conférence Nationale en Intelligence Artificielle, Jul 2019, Toulouse, France. ⟨hal-02328812⟩

Share

Metrics

Record views

22

Files downloads

18