Switch to: References

Add citations

You must login to add citations.
  1. Group Announcement Logic.Thomas Ågotnes, Philippe Balbiani, Hans van Ditmarsch & Pablo Seban - 2010 - Journal of Applied Logic 8 (1):62-81.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • What Will They Say?—Public Announcement Games.Ågotnes Thomas & Ditmarsch Hans van - 2011 - Synthese 179 (S1):57 - 85.
    Dynamic epistemic logic describes the possible information-changing actions available to individual agents, and their knowledge pre-and post conditions. For example, public announcement logic describes actions in the form of public, truthful announcements. However, little research so far has considered describing and analysing rational choice between such actions, i.e., predicting what rational self-interested agents actually will or should do. Since the outcome of information exchange ultimately depends on the actions chosen by all the agents in the system, and assuming that agents (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • An Alternating-Time Temporal Logic with Knowledge, Perfect Recall and Past: Axiomatisation and Model-Checking.Dimitar P. Guelev, Catalin Dima & Constantin Enea - 2011 - Journal of Applied Non-Classical Logics 21 (1):93-131.
    We present a variant of ATL with incomplete information which includes the distributed knowledge operators corresponding to synchronous action and perfect recall. The cooperation modalities assume the use the distributed knowledge of coalitions and accordingly refer to perfect recall incomplete information strategies. We propose a model-checking algorithm for the logic. It is based on techniques for games with imperfect information and partially observable objectives, and involves deciding emptiness for automata on infinite trees. We also propose an axiomatic system and prove (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Dynamic Logic of Agency I: Stit, Capabilities and Powers.Andreas Herzig & Emiliano Lorini - 2010 - Journal of Logic, Language and Information 19 (1):89-121.
    The aim of this paper, is to provide a logical framework for reasoning about actions, agency, and powers of agents and coalitions in game-like multi-agent systems. First we define our basic Dynamic Logic of Agency ( ). Differently from other logics of individual and coalitional capability such as Alternating-time Temporal Logic (ATL) and Coalition Logic, in cooperation modalities for expressing powers of agents and coalitions are not primitive, but are defined from more basic dynamic logic operators of action and (historic) (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Reasoning with Protocols Under Imperfect Information.Eric Pacuit & Sunil Simon - 2011 - Review of Symbolic Logic 4 (3):412-444.
    We introduce and study a PDL-style logic for reasoning about protocols, or plans, under imperfect information. Our paper touches on a number of issues surrounding the relationship between an agent’s abilities, available choices, and information in an interactive situation. The main question we address is under what circumstances can the agent commit to a protocol or plan, and what can she achieve by doing so?
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Action Types in Stit Semantics.John Horty & Eric Pacuit - 2017 - Review of Symbolic Logic 10 (4):617-637.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Logic of Strategic Ability Under Bounded Memory.Thomas Ågotnes & Dirk Walther - 2009 - Journal of Logic, Language and Information 18 (1):55-77.
    We study the logic of strategic ability of coalitions of agents with bounded memory by introducing Alternating-time Temporal Logic with Bounded Memory (ATLBM), a variant of Alternating-time Temporal Logic (ATL). ATLBM accounts for two main consequences of the assumption that agents have bounded memory. First, an agent can only remember a strategy that specifies actions in a bounded number of different circumstances. While the ATL-formula means that coalition C has a joint strategy which will make φ true forever, the ATLBM-formula (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Complexity Results of STIT Fragments.François Schwarzentruber - 2012 - Studia Logica 100 (5):1001-1045.
    We provide a Kripke semantics for a STIT logic with the "next" operator. As the atemporal group STIT is undecidable and unaxiomatizable, we are interested in strict fragments of atemporal group STIT. First we prove that the satisfiability problem of a formula of the fragment made up of individual coalitions plus the grand coalition is also NEXPTIME-complete. We then generalize this result to a fragment where coalitions are in a given lattice. We also prove that if we restrict the language (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations