Strategy logic with simple goals: Tractable reasoning about strategies - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

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.
Fichier principal
Vignette du fichier
IJCAI19.pdf (361.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02377403 , version 1 (23-11-2019)

Identifiers

  • HAL Id : hal-02377403 , version 1

Cite

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⟩
89 View
87 Download

Share

Gmail Facebook X LinkedIn More