22 found
Order:
  1.  12
    Question–Answer Games.Thomas Ågotnes, Johan van Benthem, Hans van Ditmarsch & Stefan Minica - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):265-288.
    We propose strategic games wherein the strategies consist of players asking each other questions and answering those questions. We study simplifications of such games wherein two players simultaneously ask each other a question that the opponent is then obliged to answer. The motivation for our research is to model conversation including the dynamics of questions and answers, to provide new links between game theory and dynamic logics of information, and to exploit the dynamic/strategic structure that, we think, lies implicitly inside (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  2.  13
    Constructive Knowledge: What Agents Can Achieve Under Imperfect Information.Wojciech Jamroga & Thomas Ågotnes - 2007 - Journal of Applied Non-Classical Logics 17 (4):423-475.
    We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than changing the semantic structures, we generalize the usual interpretation of formulae in single states to sets of states. We also propose a new epistemic operator for ?practical? or ?constructive? knowledge, and we show that the new logic (which we call Constructive Strategic Logic) is strictly more expressive than most existing solutions, while it retains the same model (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  3.  82
    Quantified Coalition Logic.Ågotnes Thomas, Hoek Wiebe van der & Wooldridge Michael - 2008 - Synthese 165 (2):269 - 294.
    We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as "every coalition satisfying property P can achieve φ" and "there exists a coalition C satisfying property P such that C can achieve φ". We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  4.  94
    Action and Knowledge in Alternating-Time Temporal Logic.Thomas Ågotnes - 2006 - Synthese 149 (2):375-407.
    Alternating-time temporal logic (ATL) is a branching time temporal logic in which statements about what coalitions of agents can achieve by strategic cooperation can be expressed. Alternating-time temporal epistemic logic (ATEL) extends ATL by adding knowledge modalities, with the usual possible worlds interpretation. This paper investigates how properties of agents’ actions can be expressed in ATL in general, and how properties of the interaction between action and knowledge can be expressed in ATEL in particular. One commonly discussed property is that (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  5.  46
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  6.  4
    Group Announcement Logic.Thomas Ågotnes, Philippe Balbiani, Hans van Ditmarsch & Pablo Seban - 2010 - Journal of Applied Logic 8 (1):62-81.
  7.  15
    Complete Axiomatizations of Finite Syntactic Epistemic States.Thomas Ågotnes & Michal Walicki - 2006 - In P. Torroni, U. Endriss, M. Baldoni & A. Omicini (eds.), Declarative Agent Languages and Technologies Iii. Springer. pp. 33--50.
  8.  64
    Logic and Intelligent Interaction.Ågotnes Thomas, Benthem Johan van & Pacuit Eric - 2009 - Synthese 169 (2):219 - 221.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  9.  5
    Robust Normative Systems and a Logic of Norm Compliance.Thomas Agotnes, Wiebe van der Hoek & Michael Wooldridge - 2010 - Logic Journal of the IGPL 18 (1):4-30.
    Although normative systems, or social laws, have proved to be a highly influential approach to coordination in multi-agent systems, the issue of compliance to such normative systems remains problematic. In all real systems, it is possible that some members of an agent population will not comply with the rules of a normative system, even if it is in their interests to do so. It is therefore important to consider the extent to which a normative system is robust, i.e., the extent (...)
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  10. Strategic Commitment and Release in Logics for Multi-Agent Systems.Thomas Ågotnes, Valentin Goranko & Wojciech Jamroga - 2008 - In Giacomo Bonanno, Wiebe van der Hoek & Michael Wooldridge (eds.), Logic and the Foundations of Game and Decision Theory. Amsterdam University Press. pp. 6006.
     
    Export citation  
     
    My bibliography  
  11.  12
    Introduction to the Special Issue.Thomas Ågotnes, Giacomo Bonanno & Wiebe van der Hoek - 2016 - Synthese 193 (3):659-662.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12.  14
    Complete Axiomatisations of Properties of Finite Sets.Thomas Agotnes & Michal Walicki - 2008 - Logic Journal of the IGPL 16 (3):293-313.
    We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, both taking a finite set as argument. We present a basic Hilbert-style axiomatisation, and study its completeness. The main results are syntactic and semantic characterisations of complete extensions of the logic.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  13.  21
    Multi-Modal CTL: Completeness, Complexity, and an Application. [REVIEW]Thomas Ågotnes, Wiebe Van der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra & Michael Wooldridge - 2009 - Studia Logica 92 (1):1-26.
    We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show that (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  14.  20
    Public Announcement Logic with Distributed Knowledge: Expressivity, Completeness and Complexity.Yì N. Wáng & Thomas Ågotnes - 2013 - Synthese 190 (S1).
    While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic ( $\mathcal{PAL }$ ) with distributed knowledge, in particular their expressivity, axiomatisations and complexity. $\mathcal{PAL }$ extended only with distributed knowledge is not more expressive than standard epistemic logic with distributed knowledge. Our focus is therefore on $\mathcal{PACD }$ , the result of adding both common and (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  15.  37
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  16.  8
    Logics for Qualitative Coalitional Games.Thomas Agotnes, Wiebe van der Hoek & Michael Wooldridge - 2009 - Logic Journal of the IGPL 17 (3):299-321.
    Qualitative Coalitional Games are a variant of coalitional games in which an agent's desires are represented as goals that are either satisfied or unsatisfied, and each choice available to a coalition is a set of goals, which would be jointly satisfied if the coalition made that choice. A coalition in a QCG will typically form in order to bring about a set of goals that will satisfy all members of the coalition. Our goal in this paper is to develop and (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  17.  7
    Multi-Modal CTL: Completeness, Complexity, and an Application.Ågotnes Thomas, Hoek Wiebe Van Der, A. Rodríguez-Aguilar Juan, Sierra Carles & Wooldridge Michael - 2009 - Studia Logica 92 (1):1 - 26.
    We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. We also show that (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  18.  7
    Logic and Games: An Introduction.Thomas Ågotnes - 2014 - Studia Logica 102 (2):231-234.
  19.  5
    Formal Models of Awareness.Thomas Ågotnes & Natasha Alechina - 2014 - Journal of Logic, Language and Information 23 (2):105-106.
    This special issue on Formal Models of Awareness contains five papers that concentrate on different approaches to the notion of awareness. They include syntactic and semantic approaches to modelling awareness and an alternative view from the multi-agent systems perspective where awareness is identified as the ability to perceive and understand actions of other agents.Velázquez-Quesada studies a logic of plausibility acknowledgement models used to interpret the notions of implicit and explicit beliefs. The models use the notion of a formula being acknowledged (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  20.  5
    A Logic for Reasoning About Knowledge of Unawareness.Thomas Ågotnes & Natasha Alechina - 2014 - Journal of Logic, Language and Information 23 (2):197-217.
    In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of something Ann is not aware of”—without using a stronger statement such as “Ann knows that Bill is aware of \(p\) and Ann is not aware of \(p\) ”, for some particular \(p\) . In Halpern and Rêgo (Proceedings of KR 2006; Games Econ Behav 67(2):503–525, 2009b) Halpern and Rêgo introduced a logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  21.  1
    Relativized Common Knowledge for Dynamic Epistemic Logic.Yì N. Wáng & Thomas Ågotnes - 2015 - Journal of Applied Logic 13 (3):370-393.
  22.  1
    Subset Space Public Announcement Logic.Yì N. Wáng & Thomas Ågotnes - 2013 - In Kamal Lodaya (ed.), Logic and its Applications. Springer. pp. 245--257.