The complexity of one-agent refinement modal logic

[1]  Sophie Pinchinat,et al.  Refinement modal logic , 2012, Inf. Comput..

[2]  Antonis Achilleos,et al.  Closing a Gap in the Complexity of Refinement Modal Logic , 2013, ArXiv.

[3]  Sophie Pinchinat,et al.  Future Event Logic - Axioms and Complexity , 2010, Advances in Modal Logic.

[4]  Tim French,et al.  Simulation and Information: Quantifying over Epistemic Events , 2009, KRAMAS.

[5]  Andreas Herzig,et al.  ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ , 2008, The Review of Symbolic Logic.

[6]  Kit Fine,et al.  Propositional quantifiers in modal logic1 , 2008 .

[7]  Tim French,et al.  Undecidability for arbitrary public announcement logic , 2008, Advances in Modal Logic.

[8]  Sophie Pinchinat.  A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies , 2007, ATVA.

[9]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.

[10]  Lawrence S. Moss,et al.  Topology and Epistemic Logic , 2007, Handbook of Spatial Logics.

[11]  Tim French,et al.  Bisimulation quantifiers for modal logics , 2006 .

[12]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[13]  Andrei Voronkov,et al.  Upper Bounds for a Theory of Queues , 2003, ICALP.

[14]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[15]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[16]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[17]  Orna Kupferman,et al.  Verification of Fair Transisiton Systems , 1996, CAV.

[18]  A. Visser.  Bisimulations, model descriptions and propositional quantifiers , 1996 .

[19]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[20]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[21]  Leonard Berman,et al.  The Complexity of Logical Theories , 1980, Theor. Comput. Sci..

[22]  A. K. Chandra,et al.  Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[23]  Jeanne Ferrante,et al.  A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[24]  D. Gallin.  Review: Kit Fine, Propositional Quantifiers in Modal Logic , 1973 .