Relentful strategic reasoning in alternating-time temporal logic
暂无分享,去创建一个
[1] Aniello Murano,et al. The Complexity of Enriched µ-Calculi , 2006, ICALP.
[2] E. Muller David,et al. Alternating automata on infinite trees , 1987 .
[3] Fabio Mogavero. Reasoning About Strategies , 2013, FSTTCS 2013.
[4] Amir Pnueli,et al. Once and for all [temporal logic] , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[5] Xiaowei Huang,et al. Bounded planning for strategic goals with incomplete information and perfect recall , 2013, AAMAS.
[6] Moshe Y. Vardi. Reasoning about The Past with Two-Way Automata , 1998, ICALP.
[7] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[8] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[9] Orna Kupferman,et al. Memoryful Branching-Time Logic , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[10] Wojciech Jamroga,et al. Strategic Planning through Model Checking of ATL Formulae , 2004, ICAISC.
[11] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.
[12] Orna Kupferman,et al. Weak alternating automata and tree automata emptiness , 1998, STOC '98.
[13] Aniello Murano,et al. Relentful strategic reasoning in alternating-time temporal logic , 2010, J. Log. Comput..
[14] Aniello Murano,et al. Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.
[15] Aniello Murano,et al. Graded Computation Tree Logic with Binary Coding , 2010, CSL.
[16] Marsha Chechik,et al. Robust Vacuity for Branching Temporal Logic , 2010, TOCL.
[17] Ronald Fagin,et al. Reasoning about knowledge , 1995 .
[18] Amir Pnueli,et al. The Glory of the Past , 1985, Logic of Programs.
[19] Pierre Wolper,et al. An automata-theoretic approach to branching-time model checking , 2000, JACM.
[20] Aniello Murano,et al. The Complexity of Enriched Mu-Calculi , 2008, Log. Methods Comput. Sci..
[21] Barbara Messing,et al. An Introduction to MultiAgent Systems , 2002, Künstliche Intell..
[22] Moshe Y. Vardi. Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.
[23] Y VardiMoshe,et al. An automata-theoretic approach to branching-time model checking , 2000 .
[24] Philippe Schnoebelen,et al. Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[25] Wojciech Jamroga,et al. Agents with truly perfect recall in alternating-time temporal logic , 2014, AAMAS.
[26] Moshe Y. Vardi. A temporal fixpoint calculus , 1988, POPL '88.
[27] Helen Nissenbaum,et al. Privacy and contextual integrity: framework and applications , 2006, 2006 IEEE Symposium on Security and Privacy (S&P'06).
[28] Amir Pnueli,et al. Discriminative Model Checking , 2008, CAV.
[29] Reiko Heckel,et al. Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets , 2007, Log. Methods Comput. Sci..
[30] D. Studi,et al. Università degli Studi di Napoli Federico II , 2009 .
[31] Paolo Traverso,et al. Strong Cyclic Planning Revisited , 1999, ECP.
[32] Amir Pnueli,et al. Once and for all , 1995, J. Comput. Syst. Sci..
[33] Aniello Murano,et al. A Decidable Fragment of Strategy Logic , 2012, ArXiv.
[34] Pierre-Yves Schobbens,et al. Alternating-time logic with imperfect recall , 2004, LCMAS.
[35] Sven Schewe. ATL* Satisfiability Is 2EXPTIME-Complete , 2008, ICALP.
[36] Michael Wooldridge,et al. Introduction to multiagent systems , 2001 .
[37] Wojciech Jamroga,et al. Comparing variants of strategic ability: how uncertainty and memory influence general properties of games , 2014, Autonomous Agents and Multi-Agent Systems.
[38] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[39] Md. Shamim Ashik,et al. Towards Practical Privacy Policy Enforcement , 2011 .
[40] Pierre Wolper,et al. Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.
[41] Aniello Murano,et al. What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic , 2012, CONCUR.
[42] Dov M. Gabbay,et al. The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.
[43] Bernd Finkbeiner,et al. Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus , 2006, CSL.
[44] Thomas A. Henzinger,et al. Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[45] Marco Pistore,et al. The Planning Spectrum - One, Two, Three, Infinity , 2007, J. Artif. Intell. Res..
[46] David E. Muller,et al. Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..
[47] Dana Fisman,et al. Rational Synthesis , 2009, TACAS.
[48] Richard E. Ladner,et al. Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..
[49] Matthew S. Bauer. A PSPACE-complete first-order fragment of computability logic , 2012, ACM Trans. Comput. Log..
[50] Aniello Murano,et al. Graded Computation Tree Logic , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.
[51] Orna Kupferman,et al. Module Checking Revisited , 1997, CAV.
[52] David E. Muller,et al. Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra , 1995, Theor. Comput. Sci..
[53] Igor Walukiewicz,et al. Automata for the Modal mu-Calculus and related Results , 1995, MFCS.
[54] Michael Wooldridge,et al. Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.
[55] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .