{"type":"ScholarlyArticle","title":"Strategy Logic with Simple Goals: Tractable Reasoning about Strategies","authors":[{"name":"Francesco Belardinelli","slug":"francesco-belardinelli","given":"Francesco","family":"Belardinelli","affiliation":"Imperial College London , UK; Université d'Evry , France"},{"name":"Wojciech Jamroga","slug":"wojciech-jamroga","given":"Wojciech","family":"Jamroga","affiliation":"Institute of Computer Science , Polish Academy of Sciences , Warsaw , Poland; Interdisciplinary Centre for Security , Reliability, and Trust , SnT , University of Luxembourg"},{"name":"Damian Kurpiewski","slug":"damian-kurpiewski","given":"Damian","family":"Kurpiewski","affiliation":"Institute of Computer Science , Polish Academy of Sciences , Warsaw , Poland"},{"name":"Vadim Malvone","slug":"vadim-malvone","given":"Vadim","family":"Malvone","affiliation":"Université d'Evry , France"},{"name":"Aniello Murano","slug":"aniello-murano","given":"Aniello","family":"Murano","affiliation":"Università degli studi di Napoli \"Federico II\" , Italy"}],"abstract":"In this paper we introduce Strategy Logic with simple goals (SL[SG]), a fragment of Strategy Logic that strictly extends the well-known 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. Most importantly, we prove that the model checking problem for SL[SG] is PTIME-complete, the same as ATL. Thus, the extra expressive power comes at no computational cost as far as verification is concerned.","doi":"10.24963/ijcai.2019/13","url":"https://ijcai.org/proceedings/2019/13","pdf":"https://ijcai.org/proceedings/2019/0013.pdf","markdown":"https://ijcai.org/proceedings/2019/13.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/13","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":13,"pages":{"first":88,"last":94},"keywords":["Agent-based and Multi-agent Systems: Agent Theories and Models","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis"],"videos":[],"references":[{"position":1,"raw":"[Ågotnes et al., 2007] T. Ågotnes, V. Goranko, and W. Jamroga. Alternating-Time Temporal Logics with Irrevocable Strategies. In TARK'07, pages 15-24, 2007.","title":"Alternating-Time Temporal Logics with Irrevocable Strategies","authors":"T Ågotnes, V Goranko, W Jamroga","year":"2007","venue":"TARK'07","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alur and La Torre, 2004] R. Alur and S. La Torre. Deterministic generators and games for LTL fragments. ACM Trans. Comput. Log., 5(1):1-25, 2004.","title":"Deterministic generators and games for LTL fragments","authors":"R Alur, S, La Torre","year":"2004","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alur et al., 2001] R. Alur, L. de Alfaro, R. Grosu, T. Henzinger, A. Thomas, M. Kang, C. Kirsch, R. Majumdar F. Mang, and B- Y. Wang. jMocha: A model checking tool that exploits design structure. In ICSE'01, pages 835-836. IEEE, 2001.","title":"jMocha: A model checking tool that exploits design structure","authors":"R Alur, L De Alfaro, R Grosu, T Henzinger, A Thomas, M Kang, C Kirsch, R Majumdar, F Mang, B-Y Wang","year":"2001","venue":"ICSE'01","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Alur et al., 2002] R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. J. ACM, 49(5):672-713, 2002.","title":"Alternating-time temporal logic","authors":"R Alur, T A Henzinger, O Kupferman","year":"2002","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Belardinelli et al., 2018] F. Belardinelli, C. Dima, and A. Murano. Bisimulations for logics of strategies: A study in expressiveness and verification. In KR'18, pages 425-434, 2018.","title":"Bisimulations for logics of strategies: A study in expressiveness and verification","authors":"F Belardinelli, C Dima, A Murano","year":"2018","venue":"KR'","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bouyer et al., 2015] P. Bouyer, P. Gardy, and N. Markey. Weighted strategy logic with boolean goals over one-counter games. In FSTTCS'15, pages 69-83, 2015.","title":"Weighted strategy logic with boolean goals over one-counter games","authors":"P Bouyer, P Gardy, N Markey","year":"2015","venue":"FSTTCS'15","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brihaye et al., 2009] T. Brihaye, A. Da Costa Lopes, F. Laroussinie, and N. Markey. ATL with strategy contexts and bounded memory. In LFCS'09, pages 92-106, 2009.","title":"ATL with strategy contexts and bounded memory","authors":"T Brihaye, A Da Costa Lopes, F Laroussinie, N Markey","year":"2009","venue":"LFCS'09","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bruyère et al., 2013] V. Bruyère, E. Filiot, M. Randour, and J. F. Raskin. Meet your expectations with guarantees: Beyond worst- case synthesis in quantitative games. CoRR,abs/1309.5439, 2013.","title":"Meet your expectations with guarantees: Beyond worstcase synthesis in quantitative games","authors":"V Bruyère, E Filiot, M Randour, J F Raskin","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bulling and Jamroga, 2010] N. Bulling and W. Jamroga. Verifying agents with memory is harder than it seemed. AI Communica- tions, 23:380-403, 2010.","title":"Verifying agents with memory is harder than it seemed","authors":"N Bulling, W Jamroga","year":"2010","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cermák et al., 2014] P. Cermák, A. Lomuscio, F. Mogavero, and A. Murano. MCMAS-SLK: A model checker for the verification of strategy logic specifications. In CAV'14, pages 525-532, 2014.","title":"MCMAS-SLK: A model checker for the verification of strategy logic specifications","authors":"P Cermák, A Lomuscio, F Mogavero, A Murano","year":"2014","venue":"CAV'14","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Cermák et al., 2015] P. Cermák, A. Lomuscio, and A. Murano. Verifying and synthesising multi-agent systems against one-goal strategy logic specifications. In AAAI'15, pages 2038-2044, 2015.","title":"Verifying and synthesising multi-agent systems against one-goal strategy logic specifications","authors":"P Cermák, A Lomuscio, A Murano","year":"2015","venue":"AAAI'15","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Cermák et al., 2018] P. Cermák, A. Lomuscio, F. Mogavero, and A. Murano. Practical verification of multi-agent systems against SLK specifications. I&C, 261(Part 3):588-614, 2018.","title":"Practical verification of multi-agent systems against SLK specifications","authors":"P Cermák, A Lomuscio, F Mogavero, A Murano","year":"2018","venue":"I&C","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chatterjee et al., 2010] K. Chatterjee, T.A. Henzinger, and N. Piterman. Strategy Logic. I&C, 208(6):677-693, 2010.","title":"Strategy Logic","authors":"K Chatterjee, T A Henzinger, N Piterman","year":"2010","venue":"I&C","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Chatterjee et al., 2014] K. Chatterjee, L. Doyen, S. Nain, and M. Y. Vardi. The complexity of partial-observation stochastic parity games with finite-memory strategies. In ICFSSCS'14, pages 242-257, 2014.","title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","authors":"K Chatterjee, L Doyen, S Nain, M Y Vardi","year":"2014","venue":"ICFSSCS'","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Cimatti et al., 2002] A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tac- chella. NUSMV2: An open-source tool for symbolic model checking. In CAV'02, pages 359-364, 2002.","title":"NUSMV2: An open-source tool for symbolic model checking","authors":"A Cimatti, E M Clarke, E Giunchiglia, F Giunchiglia, M Pistore, M Roveri, R Sebastiani, A Tacchella","year":"2002","venue":"CAV'02","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gammie and van der Meyden, 2004] P. Gammie and R. van der Meyden. MCK: Model checking the logic of knowledge. In CAV'04, pages 479-483, 2004.","title":"MCK: Model checking the logic of knowledge","authors":"P Gammie, R Van Der Meyden","year":"2004","venue":"CAV'04","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gardy et al., 2018] P. Gardy, P. Bouyer, and N. Markey. Depen- dences in strategy logic. In STACS'18, pages 34:1-34:15, 2018.","title":"Dependences in strategy logic","authors":"P Gardy, P Bouyer, N Markey","year":"2018","venue":"STACS'18","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Hoek and Wooldridge, 2003] W. van der Hoek and M. Wooldridge. Cooperation, knowledge, and time: Alternating- time temporal epistemic logic and its applications. Studia Logica, 75(1):125-157, 2003.","title":"Cooperation, knowledge, and time: Alternatingtime temporal epistemic logic and its applications","authors":"W Van Der Hoek, M Wooldridge","year":"2003","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Huang and van der Meyden, 2014] X. Huang and R. van der Mey- den. Symbolic model checking epistemic strategy logic. In AAAI'14, pages 1426-1432, 2014.","title":"Symbolic model checking epistemic strategy logic","authors":"Van Huang, ; X Der Meyden, R Huang, Van Der Meyden","year":"2014","venue":"AAAI'14","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Jamroga and Bulling, 2011] W. Jamroga and N. Bulling. Compar- ing variants of strategic ability. In IJCAI'11, pages 252-257, 2011.","title":"Comparing variants of strategic ability","authors":"W Jamroga, N Bulling","year":"2011","venue":"IJCAI'11","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Jamroga and Murano, 2014] W. Jamroga and A. Murano. On mod- ule checking and strategies. In AAMAS'14, pages 701-708, 2014.","title":"On module checking and strategies","authors":"W Jamroga, A Murano","year":"2014","venue":"AAMAS'14","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Jamroga and van der Hoek, 2004] W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Informati- cae, 62:1-35, 2004.","title":"Agents that know how to play","authors":"W Jamroga, W Van Der Hoek","year":"2004","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Jamroga et al., 2017a] W. Jamroga, M. Knapik, and D. Kurpiewski. Fixpoint approximation of strategic abilities under imperfect information. In AAMAS'17, pages 1241-1249, 2017.","title":"Fixpoint approximation of strategic abilities under imperfect information","authors":"Jamroga","year":"2017","venue":"AAMAS'17","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Jamroga et al., 2017b] W. Jamroga, V. Malvone, and A. Murano. Reasoning about natural strategic ability. In AAMAS'17, pages 714-722, 2017.","title":"Reasoning about natural strategic ability","authors":"Jamroga","year":"2017","venue":"AAMAS'17","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Kacprzak et al., 2008] M. Kacprzak, W. Nabialek, A. Niewiadom- ski, W. Penczek, A. Pólrola, M. Szreter, B. Woźna, and A. Zbrzezny. Verics 2007 -a model checker for knowledge and real-time. Fundamenta Informaticae, 85(1):313-328, 2008.","title":"Verics 2007 -a model checker for knowledge and real-time","authors":"M Kacprzak, W Nabialek, A Niewiadomski, W Penczek, A Pólrola, M Szreter, B Woźna, A Zbrzezny","year":"2008","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Katoen, 2008] C. Baier J. P. Katoen. Principles of Model Checking (Representation and Mind Series). The MIT Press, 2008.","title":"Principles of Model Checking (Representation and Mind Series)","authors":"C Baier, J P Katoen","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Laroussinie and Markey, 2015] F. Laroussinie and N. Markey. Augmenting atl with strategy contexts. I&C, (245):98-123, 2015.","title":"Augmenting atl with strategy contexts","authors":"F Laroussinie, N Markey","year":"2015","venue":"I&C","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Lomuscio et al., 2015] A. Lomuscio, H. Qu, and F. Raimondi. MCMAS: A model checker for the verification of multi-agent systems. Software Tools for Technology Transfer, 2015.","title":"MCMAS: A model checker for the verification of multi-agent systems","authors":"A Lomuscio, H Qu, F Raimondi","year":"2015","venue":"Software Tools for Technology Transfer","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Malvone et al., 2018] V. Malvone, F. Mogavero, A. Murano, and L. Sorrentino. Reasoning about graded strategy quantifiers. I&C, 259:390 -411, 2018.","title":"Reasoning about graded strategy quantifiers","authors":"V Malvone, F Mogavero, A Murano, L Sorrentino","year":"2018","venue":"I&C","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Mogavero et al., 2012] F. Mogavero, A. Murano, G. Perelli, and M. Vardi. What makes ATL* decidable? a decidable fragment of strategy logic. In CONCUR'12, pages 193-208, 2012.","title":"What makes ATL* decidable? a decidable fragment of strategy logic","authors":"F Mogavero, A Murano, G Perelli, M Vardi","year":"2012","venue":"CONCUR'12","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Mogavero et al., 2014] F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. Reasoning about strategies: On the model-checking problem. ACM Trans. Comput. Log., 15(4):34:1-34:47, 2014.","title":"Reasoning about strategies: On the model-checking problem","authors":"F Mogavero, A Murano, G Perelli, M Y Vardi","year":"2014","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Mogavero et al., 2017] F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. Reasoning about strategies: on the satisfiability problem. Logical Methods in Computer Science, 13(1), 2017.","title":"Reasoning about strategies: on the satisfiability problem","authors":"F Mogavero, A Murano, G Perelli, M Y Vardi","year":"2017","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Pauly, 2002] M. Pauly. A modal logic for coalitional power in games. J. Log. Comput., 12(1):149-166, 2002.","title":"A modal logic for coalitional power in games","authors":"M Pauly","year":"2002","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Tabatabaei et al., 2016] M. Tabatabaei, W. Jamroga, and Pe- ter Y. A. Ryan. Expressing receipt-freeness and coercion- resistance in logics of strategic ability: Preliminary attempt. In PrAISe@ECAI 2016, pages 1:1-1:8, 2016.","title":"Expressing receipt-freeness and coercionresistance in logics of strategic ability: Preliminary attempt","authors":"M Tabatabaei, W Jamroga, Peter Y A Ryan","year":"2016","venue":"PrAISe@ECAI 2016","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Vester, 2013] S. Vester. Alternating-time temporal logic with finite-memory strategies. In GandALF'13, pages 194-207, 2013.","title":"Alternating-time temporal logic with finite-memory strategies","authors":"S Vester","year":"2013","venue":"GandALF'","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}