19 found
Sort by:
  1. Thomas Ågotnes (2014). Logic and Games: An Introduction. Studia Logica 102 (2):231-234.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Thomas Ågotnes & Natasha Alechina (2014). A Logic for Reasoning About Knowledge of Unawareness. 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)  
     
    My bibliography  
     
    Export citation  
  3. Thomas Ågotnes & Natasha Alechina (2014). Formal Models of Awareness. 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 (awareness of formulas as opposed to awareness of semantic objects such as sets of possoble worlds) 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 (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Yì N. Wáng & Thomas Ågotnes (2013). Public Announcement Logic with Distributed Knowledge: Expressivity, Completeness and Complexity. Synthese (S1):1-28.
    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 (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Yì N. Wáng & Thomas Ågotnes (2013). Subset Space Public Announcement Logic. In Kamal Lodaya (ed.), Logic and its Applications. Springer. 245--257.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. Thomas Ågotnes & Hans van Ditmarsch (2011). What Will They Say?—Public Announcement Games. 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 (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Thomas Ågotnes, Johan van Benthem, Hans van Ditmarsch & Stefan Minica (2011). Question–Answer Games. 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)  
     
    My bibliography  
     
    Export citation  
  8. Thomas Ågotnes & Hans van Ditmarsch (2011). What Will They Say?—Public Announcement Games. Synthese 179 (1):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 (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Thomas Ågotnes, Johan van Benthem & Eric Pacuit (2009). Logic and Intelligent Interaction. Synthese 169 (2):219 - 221.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Thomas Ågotnes, Wiebe Van Der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra & Michael Wooldridge (2009). Multi-Modal CTL: Completeness, Complexity, and an Application. 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)  
     
    My bibliography  
     
    Export citation  
  11. Thomas Ågotnes, Johan van Benthem & Eric Pacuit (2009). Logic and Intelligent Interaction. Synthese 169 (2):219 - 221.
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  12. Thomas Ågotnes, Wiebe Van der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra & Michael Wooldridge (2009). Multi-Modal CTL: Completeness, Complexity, and an Application. [REVIEW] 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 (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Thomas Ågotnes & Dirk Walther (2009). A Logic of Strategic Ability Under Bounded Memory. 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)  
     
    My bibliography  
     
    Export citation  
  14. Thomas Ågotnes, Valentin Goranko & Wojciech Jamroga (2008). Strategic Commitment and Release in Logics for Multi-Agent Systems. In Giacomo Bonanno, Wiebe van der Hoek & Michael Wooldridge (eds.), Logic and the Foundations of Game and Decision Theory. Amsterdam University Press. 6006.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  15. Thomas Ågotnes, Wiebe van der Hoek & Michael Wooldridge (2008). Quantified Coalition Logic. 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 (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. Thomas Ågotnes, Wiebe van der Hoek & Michael Wooldridge (2008). Quantified Coalition Logic. 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)  
     
    My bibliography  
     
    Export citation  
  17. Wojciech Jamroga & Thomas Ågotnes (2007). Constructive Knowledge: What Agents Can Achieve Under Imperfect Information. 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)  
     
    My bibliography  
     
    Export citation  
  18. Thomas Ågotnes (2006). Action and Knowledge in Alternating-Time Temporal Logic. 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)  
     
    My bibliography  
     
    Export citation  
  19. Thomas Ågotnes & Michal Walicki (2006). Complete Axiomatizations of Finite Syntactic Epistemic States. In P. Torroni, U. Endriss, M. Baldoni & A. Omicini (eds.), Declarative Agent Languages and Technologies Iii. Springer. 33--50.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation