Strategy logic with simple goals: Tractable reasoning about strategies

Abstract : In this paper we introduce Strategy Logic with Simple Goals (SL[SG]), a fragment of Strategy Logic that strictly extends Alternating-time Temporal Logic ATL by introducing arbitrary quantification over the agents' strategies. Our motivation comes from game-theoretic applications, such as expressing Stackelberg equilibria in games, coercion in voting protocols, as well as module checking for simple goals. We prove that model checking SL[SG] is P-complete, the same as ATL. Thus, the extra expressive power comes at no computational cost as far as verification is concerned.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02377403
Contributor : Frédéric Davesne <>
Submitted on : Saturday, November 23, 2019 - 5:35:49 PM
Last modification on : Tuesday, November 26, 2019 - 5:18:53 PM

File

IJCAI19.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02377403, version 1

Citation

Francesco Belardinelli, Wojciech Jamroga, Vadim Malvone, Aniello Murano. Strategy logic with simple goals: Tractable reasoning about strategies. 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), Aug 2019, Macao, China. pp.88--94. ⟨hal-02377403⟩

Share

Metrics

Record views

104

Files downloads

20