{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T08:02:48Z","timestamp":1770710568398,"version":"3.49.0"},"reference-count":129,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001866","name":"Fonds National de la Recherche Luxembourg","doi-asserted-by":"publisher","award":["POLLUX-IV\/1\/2016"],"award-info":[{"award-number":["POLLUX-IV\/1\/2016"]}],"id":[{"id":"10.13039\/501100001866","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005632","name":"Narodowe Centrum Bada\u0144 i Rozwoju","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005632","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007195","name":"Universit\u00e0 degli Studi di Napoli Federico II","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007195","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1016\/j.artint.2019.103170","type":"journal-article","created":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T08:17:17Z","timestamp":1567585037000},"page":"103170","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"special_numbering":"C","title":["Natural strategic ability"],"prefix":"10.1016","volume":"277","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6340-8845","authenticated-orcid":false,"given":"Wojciech","family":"Jamroga","sequence":"first","affiliation":[]},{"given":"Vadim","family":"Malvone","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4876-3448","authenticated-orcid":false,"given":"Aniello","family":"Murano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.artint.2019.103170_br0010","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s11229-005-3875-8","article-title":"Action and knowledge in alternating-time temporal logic","volume":"149","author":"\u00c5gotnes","year":"2006","journal-title":"Synthese"},{"key":"10.1016\/j.artint.2019.103170_br0020","series-title":"Proceedings of TARK XI","first-page":"15","article-title":"Alternating-time temporal logics with irrevocable strategies","author":"\u00c5gotnes","year":"2007"},{"key":"10.1016\/j.artint.2019.103170_br0030","series-title":"Handbook of Epistemic Logic","first-page":"543","article-title":"Knowledge and ability","author":"\u00c5gotnes","year":"2015"},{"issue":"1","key":"10.1016\/j.artint.2019.103170_br0040","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10849-008-9075-4","article-title":"A logic of strategic ability under bounded memory","volume":"18","author":"\u00c5gotnes","year":"2009","journal-title":"J. Log. Lang. Inf."},{"key":"10.1016\/j.artint.2019.103170_br0050","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.artint.2016.12.005","article-title":"The virtues of idleness: a decidable fragment of resource agent logic","volume":"245","author":"Alechina","year":"2017","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2019.103170_br0060","series-title":"Proceedings of AAAI","first-page":"795","article-title":"A logic of agent programs","author":"Alechina","year":"2007"},{"key":"10.1016\/j.artint.2019.103170_br0070","series-title":"Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems","first-page":"1455","article-title":"Reasoning about agent execution strategies","author":"Alechina","year":"2008"},{"key":"10.1016\/j.artint.2019.103170_br0080","series-title":"Proceedings of International Joint Conference on Artificial Intelligence","first-page":"659","article-title":"A logic for coalitions with bounded resources","author":"Alechina","year":"2009"},{"key":"10.1016\/j.artint.2019.103170_br0090","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.jcss.2017.03.008","article-title":"Model-checking for resource-bounded ATL with production and consumption of resources","volume":"88","author":"Alechina","year":"2017","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.artint.2019.103170_br0100","series-title":"Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems","first-page":"481","article-title":"Resource-bounded alternating-time temporal logic","author":"Alechina","year":"2010"},{"key":"10.1016\/j.artint.2019.103170_br0110","series-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science","first-page":"100","article-title":"Alternating-time temporal logic","author":"Alur","year":"1997"},{"key":"10.1016\/j.artint.2019.103170_br0120","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/585265.585270","article-title":"Alternating-time temporal logic","volume":"49","author":"Alur","year":"2002","journal-title":"J. ACM"},{"key":"10.1016\/j.artint.2019.103170_br0130","series-title":"Proceedings of KR","first-page":"258","article-title":"Prompt alternating-time epistemic logics","author":"Aminof","year":"2016"},{"key":"10.1016\/j.artint.2019.103170_br0140","series-title":"Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems","first-page":"1460","article-title":"Timed ATL: forget memory, just count","author":"Andre","year":"2017"},{"key":"10.1016\/j.artint.2019.103170_br0150","series-title":"Third World Congress of the Game Theory Society","article-title":"Bounded memory with finite action spaces","author":"Barlo","year":"2008"},{"key":"10.1016\/j.artint.2019.103170_br0160","series-title":"Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems AAMAS 2017","first-page":"1286","article-title":"Bisimulations for verification of strategic abilities with application to ThreeBallot voting protocol","author":"Belardinelli","year":"2017"},{"key":"10.1016\/j.artint.2019.103170_br0170","series-title":"Proceedings of AAMAS","first-page":"1268","article-title":"Verification of multi-agent systems with imperfect information and public actions","author":"Belardinelli","year":"2017"},{"key":"10.1016\/j.artint.2019.103170_br0180","series-title":"Proceedings 2nd International Workshop on Strategic Reasoning","first-page":"27","article-title":"Reasoning about knowledge and strategies: epistemic strategy logic","author":"Belardinelli","year":"2014"},{"key":"10.1016\/j.artint.2019.103170_br0190","series-title":"IJCAI 2018","first-page":"77","article-title":"Alternating-time temporal logic on finite traces","author":"Belardinelli","year":"2018"},{"key":"10.1016\/j.artint.2019.103170_br0200","series-title":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing","first-page":"544","article-title":"Receipt-free secret-ballot elections","author":"Benaloh","year":"1994"},{"key":"10.1016\/j.artint.2019.103170_br0210","series-title":"Proceedings of LICS","first-page":"1","article-title":"Strategy logic with imperfect information","author":"Berthon","year":"2017"},{"issue":"20","key":"10.1016\/j.artint.2019.103170_br0220","first-page":"925","article-title":"A foundation for Markov equilibria in sequential games with finite social memory","volume":"80","author":"Bhaskar","year":"2012","journal-title":"Rev. Econ. Stud."},{"key":"10.1016\/j.artint.2019.103170_br0230","series-title":"Proceedings of Tools and Algorithms for Construction and Analysis of Systems","first-page":"193","article-title":"Symbolic model checking without BDDs","volume":"vol. 1579","author":"Biere","year":"1999"},{"key":"10.1016\/j.artint.2019.103170_br0240","series-title":"Proceedings of ECAI","first-page":"265","article-title":"Boolean games revisited","author":"Bonzon","year":"2006"},{"issue":"2","key":"10.1016\/j.artint.2019.103170_br0250","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10458-006-5955-7","article-title":"Verifying multi-agent programs by model checking","volume":"12","author":"Bordini","year":"2006","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.artint.2019.103170_br0260","series-title":"Proceedings of AAMAS","first-page":"1294","article-title":"AgentSpeak(XL): efficient intention selection in BDI agents via decision-theoretic task scheduling","author":"Bordini","year":"2002"},{"key":"10.1016\/j.artint.2019.103170_br0270","article-title":"Programming Multi-Agent Systems in AgentSpeak Using Jason","author":"Bordini","year":"2007"},{"key":"10.1016\/j.artint.2019.103170_br0280","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1037\/h0030000","article-title":"Knowing and using concepts","volume":"77","author":"Bourne","year":"1970","journal-title":"Psychol. Rev."},{"key":"10.1016\/j.artint.2019.103170_br0290","article-title":"Specifying non-Markovian rewards in MDPs using LDL on finite traces (preliminary version)","author":"Brafman","year":"2017","journal-title":"CoRR"},{"key":"10.1016\/j.artint.2019.103170_br0300","series-title":"Proceedings of CAV","first-page":"158","article-title":"Counterexample explanation by learning small strategies in Markov Decision Processes","author":"Brazdil","year":"2015"},{"key":"10.1016\/j.artint.2019.103170_br0310","series-title":"Proceedings of TACAS","article-title":"Strategy representation by decision trees in reactive synthesis","author":"Brazdil","year":"2018"},{"key":"10.1016\/j.artint.2019.103170_br0320","series-title":"Proceedings of CONCUR","first-page":"445","article-title":"Timed concurrent game structures","author":"Brihaye","year":"2007"},{"key":"10.1016\/j.artint.2019.103170_br0330","series-title":"Proceedings of LFCS","first-page":"92","article-title":"ATL with strategy contexts and bounded memory","volume":"vol. 5407","author":"Brihaye","year":"2009"},{"issue":"46","key":"10.1016\/j.artint.2019.103170_br0340","first-page":"45","article-title":"Modelling and verifying coalitions using argumentation and ATL","volume":"14","author":"Bulling","year":"2010","journal-title":"Rev. Iberoam. Intel. Artif."},{"key":"10.1016\/j.artint.2019.103170_br0350","series-title":"Specification and Verification of Multi-Agent Systems","first-page":"125","article-title":"Model checking logics of strategic ability: complexity","author":"Bulling","year":"2010"},{"key":"10.1016\/j.artint.2019.103170_br0360","series-title":"Proceedings of Computational Logic in Multi-Agent Systems","first-page":"22","article-title":"Expressing properties of resource-bounded systems: the logics RTL* and RTL","volume":"vol. 6214","author":"Bulling","year":"2010"},{"key":"10.1016\/j.artint.2019.103170_br0370","series-title":"Proceedings of ECAI","first-page":"567","article-title":"On the (un-)decidability of model checking resource-bounded agents","volume":"vol. 215","author":"Bulling","year":"2010"},{"issue":"1\u20133","key":"10.1016\/j.artint.2019.103170_br0380","doi-asserted-by":"crossref","first-page":"81","DOI":"10.3233\/FI-2009-0089","article-title":"What agents can probably enforce","volume":"93","author":"Bulling","year":"2009","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.artint.2019.103170_br0390","doi-asserted-by":"crossref","first-page":"380","DOI":"10.3233\/AIC-2010-0481","article-title":"Verifying agents with memory is harder than it seemed","volume":"23","author":"Bulling","year":"2010","journal-title":"AI Commun."},{"issue":"3","key":"10.1016\/j.artint.2019.103170_br0400","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/s10458-013-9231-3","article-title":"Comparing variants of strategic ability: how uncertainty and memory influence general properties of games","volume":"28","author":"Bulling","year":"2014","journal-title":"J. Auton. Agents Multi-Agent Syst."},{"issue":"1\u20134","key":"10.1016\/j.artint.2019.103170_br0410","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10472-009-9110-4","article-title":"Reasoning about temporal properties of rational play","volume":"53","author":"Bulling","year":"2008","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.artint.2019.103170_br0420","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ic.2015.03.014","article-title":"Reasoning about memoryless strategies under partial observability and unconditional fairness constraints","volume":"242","author":"Busard","year":"2015","journal-title":"Inf. Comput."},{"key":"10.1016\/j.artint.2019.103170_br0430","series-title":"CAV'14","first-page":"524","article-title":"MCMAS-SLK: a model checker for the verification of strategy logic specifications","volume":"vol. 8559","author":"\u010cerm\u00e1k","year":"2014"},{"key":"10.1016\/j.artint.2019.103170_br0440","series-title":"AAAI 2015","first-page":"2038","article-title":"Verifying and synthesising multi-agent systems against one-goal strategy logic specifications","author":"\u010cerm\u00e1k","year":"2015"},{"issue":"6","key":"10.1016\/j.artint.2019.103170_br0450","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","article-title":"Strategy logic","volume":"208","author":"Chatterjee","year":"2010","journal-title":"Inf. Comput."},{"key":"10.1016\/j.artint.2019.103170_br0460","series-title":"TACAS","first-page":"185","article-title":"PRISM-games: a model checker for stochastic multi-player games","volume":"vol. 7795","author":"Chen","year":"2013"},{"key":"10.1016\/j.artint.2019.103170_br0470","series-title":"Proceedings of Logics of Programs Workshop","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","volume":"vol. 131","author":"Clarke","year":"1981"},{"key":"10.1016\/j.artint.2019.103170_br0480","series-title":"Proceedings of AAMAS","first-page":"625","article-title":"Reasoning about strategies of multi-agent programs","author":"Dastani","year":"2010"},{"issue":"9","key":"10.1016\/j.artint.2019.103170_br0490","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2701413","article-title":"Commonsense reasoning","volume":"58","author":"Davis","year":"2015","journal-title":"Commun. ACM"},{"key":"10.1016\/j.artint.2019.103170_br0500","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.tcs.2005.07.033","article-title":"Model checking discounted temporal properties","volume":"345","author":"de Alfaro","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.artint.2019.103170_br0510","series-title":"Proceedings of LICS","first-page":"141","article-title":"Concurrent omega-regular games","author":"de Alfaro","year":"2000"},{"key":"10.1016\/j.artint.2019.103170_br0520","series-title":"Proceedings of IJCAI","first-page":"854","article-title":"Linear temporal logic and linear dynamic logic on finite traces","author":"De Giacomo","year":"2013"},{"key":"10.1016\/j.artint.2019.103170_br0530","series-title":"Proceedings of IJCAI","first-page":"1558","article-title":"Synthesis for LTL and LDL on finite traces","author":"De Giacomo","year":"2015"},{"key":"10.1016\/j.artint.2019.103170_br0540","article-title":"Model-checking ATL under imperfect information and perfect recall semantics is undecidable","volume":"abs\/1102.4225","author":"Dima","year":"2011","journal-title":"CoRR"},{"key":"10.1016\/j.artint.2019.103170_br0550","series-title":"Proceedings of SR","first-page":"15","article-title":"Representing strategies","author":"Duijf","year":"2016"},{"key":"10.1016\/j.artint.2019.103170_br0560","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1038\/35036586","article-title":"Minimization of Boolean complexity in human concept learning","volume":"407","author":"Feldman","year":"2000","journal-title":"Nature"},{"key":"10.1016\/j.artint.2019.103170_br0570","series-title":"Proceedings of STACS","first-page":"325","article-title":"Succinctness of the complement and intersection of regular expressions","author":"Gelade","year":"2008"},{"key":"10.1016\/j.artint.2019.103170_br0580","series-title":"Automated Planning: Theory and Practice","author":"Ghallab","year":"2004"},{"issue":"1","key":"10.1016\/j.artint.2019.103170_br0590","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.tcs.2005.07.043","article-title":"Complete axiomatization and decidability of alternating-time temporal logic","volume":"353","author":"Goranko","year":"2006","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"10.1016\/j.artint.2019.103170_br0600","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0129054115400110","article-title":"From finite automata to regular expressions and back \u2013 a summary on descriptional complexity","volume":"26","author":"Gruber","year":"2015","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.artint.2019.103170_br0610","series-title":"Proceedings of GandALF","first-page":"16","article-title":"Making the best of limited memory in multi-player discounted sum games","author":"Gupta","year":"2015"},{"key":"10.1016\/j.artint.2019.103170_br0620","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ic.2015.03.011","article-title":"Iterated boolean games","volume":"242","author":"Gutierrez","year":"2015","journal-title":"Inf. Comput."},{"key":"10.1016\/j.artint.2019.103170_br0630","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.artint.2017.04.003","article-title":"From model checking to equilibrium checking: reactive modules for rational verification","volume":"248","author":"Gutierrez","year":"2017","journal-title":"Artif. Intell."},{"issue":"2","key":"10.1016\/j.artint.2019.103170_br0640","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(82)90003-4","article-title":"Process logic: expressiveness, decidability, completeness","volume":"25","author":"Harel","year":"1982","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.artint.2019.103170_br0650","series-title":"Logic in Conflict","author":"Harrenstein","year":"2004"},{"key":"10.1016\/j.artint.2019.103170_br0660","series-title":"Proceedings of LAMAS","article-title":"Alternating-time temporal logic with explicit programs","author":"Herzig","year":"2014"},{"issue":"4","key":"10.1016\/j.artint.2019.103170_br0670","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1010084620690","article-title":"Agent programming in 3APL","volume":"2","author":"Hindriks","year":"1999","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.artint.2019.103170_br0680","series-title":"Proceedings of ATAL","first-page":"228","article-title":"Agent programming with declarative goals","author":"Hindriks","year":"2000"},{"key":"10.1016\/j.artint.2019.103170_br0690","series-title":"Introduction to Automata Theory, Languages, And Computation","author":"Hopcroft","year":"1990"},{"key":"10.1016\/j.artint.2019.103170_br0700","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.1162\/qjec.2009.124.4.1773","article-title":"How robust is the folk theorem?","author":"H\u00f6rner","year":"2009","journal-title":"Q. J. Econ."},{"key":"10.1016\/j.artint.2019.103170_br0710","series-title":"Proceedings of AAAI Conference on Artificial Intelligence","first-page":"1426","article-title":"Symbolic model checking epistemic strategy logic","author":"Huang","year":"2014"},{"key":"10.1016\/j.artint.2019.103170_br0720","series-title":"Introduction to Expert Systems","author":"Jackson","year":"1998"},{"key":"10.1016\/j.artint.2019.103170_br0730","series-title":"Proceedings of PRIMA'08","first-page":"239","article-title":"A temporal logic for stochastic multi-agent systems","volume":"vol. 5357","author":"Jamroga","year":"2008"},{"issue":"4","key":"10.1016\/j.artint.2019.103170_br0740","doi-asserted-by":"crossref","first-page":"423","DOI":"10.3166\/jancl.17.423-475","article-title":"Constructive knowledge: what agents can achieve under incomplete information","volume":"17","author":"Jamroga","year":"2007","journal-title":"J. Appl. Non-Class. Log."},{"key":"10.1016\/j.artint.2019.103170_br0750","series-title":"Proceedings of EUMAS","article-title":"Model checking ATLir is indeed \u03942P-complete","volume":"vol. 223","author":"Jamroga","year":"2006"},{"issue":"3","key":"10.1016\/j.artint.2019.103170_br0760","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/s00224-007-9080-z","article-title":"Model checking abilities of agents: a closer look","volume":"42","author":"Jamroga","year":"2008","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.artint.2019.103170_br0770","series-title":"Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems","first-page":"1241","article-title":"Fixpoint approximation of strategic abilities under imperfect information","author":"Jamroga","year":"2017"},{"key":"10.1016\/j.artint.2019.103170_br0780","series-title":"Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems","first-page":"714","article-title":"Reasoning about natural strategic ability","author":"Jamroga","year":"2017"},{"issue":"2\u20133","key":"10.1016\/j.artint.2019.103170_br0790","first-page":"185","article-title":"Agents that know how to play","volume":"63","author":"Jamroga","year":"2004","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.artint.2019.103170_br0800","first-page":"221","article-title":"From bounded to unbounded model checking for temporal epistemic logic","volume":"63","author":"Kacprzak","year":"2004","journal-title":"Fundam. Inform."},{"issue":"2","key":"10.1016\/j.artint.2019.103170_br0810","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1006\/jeth.1997.2357","article-title":"Money is memory","volume":"81","author":"Kocherlakota","year":"1998","journal-title":"J. Econ. Theory"},{"issue":"2","key":"10.1016\/j.artint.2019.103170_br0820","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10703-009-0067-z","article-title":"From liveness to promptness","volume":"34","author":"Kupferman","year":"2009","journal-title":"Form. Methods Syst. Des."},{"key":"10.1016\/j.artint.2019.103170_br0830","series-title":"Proceedings of TOOLS","first-page":"200","article-title":"PRISM: probabilistic symbolic model checker","volume":"vol. 2324","author":"Kwiatkowska","year":"2002"},{"issue":"7","key":"10.1016\/j.artint.2019.103170_br0840","article-title":"On the expressiveness and complexity of ATL","volume":"4","author":"Laroussinie","year":"2008","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.artint.2019.103170_br0850","article-title":"An open-source model checker for the verification of multi-agent systems","author":"Lomuscio","year":"2015","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10.1016\/j.artint.2019.103170_br0860","series-title":"TACAS","first-page":"450","article-title":"A model checker for multi-agent systems","volume":"vol. 4314","author":"Lomuscio","year":"2006"},{"key":"10.1016\/j.artint.2019.103170_br0870","series-title":"Proceedings of AAMAS","first-page":"1205","article-title":"Hiding actions in multi-player games","author":"Malvone","year":"2017"},{"key":"10.1016\/j.artint.2019.103170_br0880","series-title":"International Conference on Concurrency Theory","first-page":"251","article-title":"Model checking a path","author":"Markey","year":"2003"},{"key":"10.1016\/j.artint.2019.103170_br0890","series-title":"Proceedings of CONCUR","first-page":"193","article-title":"What makes ATL* decidable? a decidable fragment of strategy logic","author":"Mogavero","year":"2012"},{"issue":"4","key":"10.1016\/j.artint.2019.103170_br0900","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2631917","article-title":"Reasoning about strategies: on the model-checking problem","volume":"15","author":"Mogavero","year":"2014","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"10.1016\/j.artint.2019.103170_br0910","article-title":"Reasoning about strategies: on the satisfiability problem","volume":"13","author":"Mogavero","year":"2017","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"10.1016\/j.artint.2019.103170_br0920","doi-asserted-by":"crossref","first-page":"277","DOI":"10.3233\/FI-2015-1235","article-title":"On promptness in parity games","volume":"139","author":"Mogavero","year":"2015","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.artint.2019.103170_br0930","series-title":"Proceedings of FSTTCS","first-page":"133","article-title":"Reasoning about strategies","author":"Mogavero","year":"2010"},{"key":"10.1016\/j.artint.2019.103170_br0940","series-title":"The Cognitive Psychology of Planning","author":"Morris","year":"2014"},{"key":"10.1016\/j.artint.2019.103170_br0950","series-title":"Usability Engineering","author":"Nielsen","year":"1994"},{"key":"10.1016\/j.artint.2019.103170_br0960","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1613\/jair.30","article-title":"Teleo-reactive programs for agent control","volume":"1","author":"Nilsson","year":"1994","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2019.103170_br0970","series-title":"Proceedings of AAMAS'09","first-page":"105","article-title":"Code patterns for agent oriented programming","author":"Nov\u00e1k","year":"2009"},{"key":"10.1016\/j.artint.2019.103170_br0980","series-title":"A Course in Game Theory","author":"Osborne","year":"1994"},{"key":"10.1016\/j.artint.2019.103170_br0990","series-title":"Proceedings of Games, Automata, Logics and Formal Verification","first-page":"162","article-title":"Imitation in large games","author":"Paul","year":"2010"},{"key":"10.1016\/j.artint.2019.103170_br1000","series-title":"Mathematical Theory and Computational Practice, Proceedings of CiE","first-page":"389","article-title":"Stability under strategy switching","author":"Paul","year":"2009"},{"key":"10.1016\/j.artint.2019.103170_br1010","series-title":"Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems","first-page":"209","article-title":"Verifying epistemic properties of multi-agent systems via bounded model checking","author":"Penczek","year":"2003"},{"key":"10.1016\/j.artint.2019.103170_br1020","series-title":"Understanding Intelligence","author":"Pfeifer","year":"1999"},{"key":"10.1016\/j.artint.2019.103170_br1030","series-title":"Symposium on Programming","first-page":"337","article-title":"Specification and verification of concurrent programs in Cesar","volume":"vol. 137","author":"Queille","year":"1981"},{"key":"10.1016\/j.artint.2019.103170_br1040","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/j.artint.2019.103170_br1050","series-title":"Modeling Bounded Rationality","author":"Rubinstein","year":"1998"},{"key":"10.1016\/j.artint.2019.103170_br1060","series-title":"Artificial Intelligence: a Modern Approach","author":"Russel","year":"1995"},{"key":"10.1016\/j.artint.2019.103170_br1070","series-title":"Dynamics of Reputation and the Self-organization of Cooperation","author":"Santos","year":"2018"},{"key":"10.1016\/j.artint.2019.103170_br1080","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1038\/nature25763","article-title":"Social norm complexity and past reputations in the evolution of cooperation","volume":"555","author":"Santos","year":"2018","journal-title":"Nature"},{"key":"10.1016\/j.artint.2019.103170_br1090","series-title":"Proceedings of ICALP 2008","first-page":"373","article-title":"ATL* satisfiability is 2ExpTime-complete","volume":"vol. 5126","author":"Schewe","year":"2008"},{"key":"10.1016\/j.artint.2019.103170_br1100","series-title":"Advances in Modal Logics, Proceedings of AiML 2002","article-title":"The complexity of temporal model checking","author":"Schnoebelen","year":"2003"},{"key":"10.1016\/j.artint.2019.103170_br1110","series-title":"Proceedings of ESORICS","first-page":"91","article-title":"Deciding epistemic and strategic properties of cryptographic protocols","author":"Schnoor","year":"2012"},{"key":"10.1016\/j.artint.2019.103170_br1120","series-title":"Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems","first-page":"1057","article-title":"Strategic planning for probabilistic games with incomplete information","author":"Schnoor","year":"2010"},{"issue":"2","key":"10.1016\/j.artint.2019.103170_br1130","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/S1571-0661(05)82604-0","article-title":"Alternating-time logic with imperfect recall","volume":"85","author":"Schobbens","year":"2004","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.artint.2019.103170_br1140","series-title":"Multiagent Systems \u2013 Algorithmic, Game-Theoretic, and Logical Foundations","author":"Shoham","year":"2009"},{"issue":"1","key":"10.1016\/j.artint.2019.103170_br1150","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.artint.2019.103170_br1160","series-title":"Proceedings of ICTAC","first-page":"583","article-title":"A tool for the automated verification of Nash equilibria in concurrent games","volume":"vol. 9399","author":"Toumi","year":"2015"},{"key":"10.1016\/j.artint.2019.103170_br1170","series-title":"Proceedings of AAMAS'05","first-page":"157","article-title":"A logic for strategic reasoning","author":"van der Hoek","year":"2005"},{"key":"10.1016\/j.artint.2019.103170_br1180","series-title":"Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems","first-page":"201","article-title":"On the complexity of practical ATL model checking","author":"van der Hoek","year":"2006"},{"key":"10.1016\/j.artint.2019.103170_br1190","series-title":"Autonomous Agents and Multiagent Systems' 02","first-page":"1167","article-title":"Tractable multiagent planning for epistemic goals","author":"van der Hoek","year":"2002"},{"issue":"1","key":"10.1016\/j.artint.2019.103170_br1200","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1026185103185","article-title":"Cooperation, knowledge and time: alternating-time temporal epistemic logic and its applications","volume":"75","author":"van der Hoek","year":"2003","journal-title":"Stud. Log."},{"key":"10.1016\/j.artint.2019.103170_br1210","series-title":"Proceedings of LCMAS'04","first-page":"77","article-title":"On epistemic temporal strategic logic","volume":"vol. 126","author":"van Otterloo","year":"2004"},{"key":"10.1016\/j.artint.2019.103170_br1220","series-title":"Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems","first-page":"152","article-title":"Preferences in game logics","author":"van Otterloo","year":"2004"},{"key":"10.1016\/j.artint.2019.103170_br1230","series-title":"Proceedings of GandALF","first-page":"194","article-title":"Alternating-time temporal logic with finite-memory strategies","author":"Vester","year":"2013"},{"key":"10.1016\/j.artint.2019.103170_br1240","series-title":"GandALF 2013","first-page":"194","article-title":"Alternating-time temporal logic with finite-memory strategies","author":"Vester","year":"2013"},{"key":"10.1016\/j.artint.2019.103170_br1250","series-title":"Theory of Games and Economic Behaviour","author":"von Neumann","year":"1944"},{"issue":"6","key":"10.1016\/j.artint.2019.103170_br1260","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1093\/logcom\/exl009","article-title":"ATL satisfiability is indeed EXPTIME-complete","volume":"16","author":"Walther","year":"2006","journal-title":"J. Log. Comput."},{"key":"10.1016\/j.artint.2019.103170_br1270","series-title":"Proceedings TARK XI","first-page":"269","article-title":"Alternating-time temporal logic with explicit strategies","author":"Walther","year":"2007"},{"key":"10.1016\/j.artint.2019.103170_br1280","series-title":"Proceedings of AAAI","first-page":"4184","article-title":"Rational verification: from model checking to equilibrium checking","author":"Wooldridge","year":"2016"},{"key":"10.1016\/j.artint.2019.103170_br1290","series-title":"Proceedings of JELIA","first-page":"437","article-title":"Reasoning about agent programs using ATL-like logics","author":"Yadav","year":"2012"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370219301717?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370219301717?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T07:21:35Z","timestamp":1757748095000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370219301717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":129,"alternative-id":["S0004370219301717"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2019.103170","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Natural strategic ability","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2019.103170","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"103170"}}