Expresiveness and Complexity Results for Strategic Reasoning
暂无分享,去创建一个
Michael Wooldridge | Julian Gutierrez | Paul Harrenstein | M. Wooldridge | J. Gutierrez | Paul Harrenstein
[1] Krishnendu Chatterjee,et al. Strategy logic , 2007, Inf. Comput..
[2] Nicolas Markey,et al. Quantified CTL: Expressiveness and Complexity , 2014, Log. Methods Comput. Sci..
[3] Thomas A. Henzinger,et al. Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[4] Michael Wooldridge,et al. Iterated Boolean games , 2013, Inf. Comput..
[5] Michael Wooldridge,et al. Logics for Multiagent Systems , 2012, AI Mag..
[6] Nicolas Markey,et al. Augmenting ATL with strategy contexts , 2015, Inf. Comput..
[7] Aniello Murano,et al. Relentful strategic reasoning in alternating-time temporal logic , 2016, J. Log. Comput..
[8] I. Walukiewicz. A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..
[9] Michael Wooldridge,et al. Equilibria of concurrent games on event structures , 2014, CSL-LICS.
[10] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[11] Aniello Murano,et al. On the Boundary of Behavioral Strategies , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[12] François Laroussinie. Temporal Logics for Games , 2010, Bull. EATCS.
[13] Orna Kupferman,et al. Memoryful Branching-Time Logic , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[14] Bernd Finkbeiner,et al. Coordination Logic , 2010, CSL.
[15] Aniello Murano,et al. Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.
[16] Krishnendu Chatterjee,et al. A survey of stochastic ω-regular games , 2012, J. Comput. Syst. Sci..
[17] Sven Schewe. ATL* Satisfiability Is 2EXPTIME-Complete , 2008, ICALP.