56 found
Order:
  1.  60
    Reasoning About Rational Agents.Michael Wooldridge & Bruce Edmonds - unknown
    what is now the mainstream view as to the best way forward in the dream of engineering reliable software systems out of autonomous agents. The way of using formal logics to specify, implement and verify distributed systems of interacting units using a guiding analogy of beliefs, desires and intentions. The implicit message behind the book is this: Distributed Artificial Intelligence (DAI) can be a respectable engineering science. It says: we use sound formal systems; can cite established philosophical foundations; and will (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   41 citations  
  2.  58
    Cooperation, Knowledge, and Time: Alternating-Time Temporal Epistemic Logic and its Applications.Wiebe van der Hoek & Michael Wooldridge - 2003 - Studia Logica 75 (1):125-157.
    Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). The key insight (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  3. Towards a Theory of Intention Revision.Wiebe van der Hoek, Wojciech Jamroga & Michael Wooldridge - 2007 - Synthese 155 (2):265-290.
    Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, and while several formal theories of intention have been proposed in the literature, the logic of intention revision has been hardly considered. There are several reasons for this: perhaps most importantly, intentions are very closely (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  4. Social Laws in Alternating Time: Effectiveness, Feasibility, and Synthesis.Wiebe van der Hoek, Mark Roberts & Michael Wooldridge - 2007 - Synthese 156 (1):1-19.
    Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent systems. First, we show that the Alternating-time Temporal Logic (atl) of Alur, Henzinger, and Kupferman provides an elegant and powerful framework within which to express and understand social laws for multiagent systems. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  5.  51
    Towards a Theory of Intention Revision.Wiebe van Der Hoek, Wojciech Jamroga & Michael Wooldridge - 2007 - Synthese 155 (2):265-290.
    Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, and while several formal theories of intention have been proposed in the literature, the logic of intention revision has been hardly considered. There are several reasons for this: perhaps most importantly, intentions are very closely (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  6.  17
    On Obligations and Normative Ability: Towards a Logical Analysis of the Social Contract.Michael Wooldridge & Wiebe van der Hoek - 2005 - Journal of Applied Logic 3 (3-4):396-420.
  7.  26
    Social Laws in Alternating Time: Effectiveness, Feasibility, and Synthesis.Wiebe van Der Hoek, Mark Roberts & Michael Wooldridge - 2007 - Synthese 156 (1):1-19.
    Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent systems. First, we show that the "Alternating-time Temporal Logic" of Alur, Henzinger, and Kupferman provides an elegant and powerful framework within which to express and understand social laws for multiagent systems. Second, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  8.  13
    Towards a Logic of Rational Agency.Wiebe van der Hoek & Michael Wooldridge - 2003 - Logic Journal of the IGPL 11 (2):135-159.
    Rational agents are important objects of study in several research communities, including economics, philosophy, cognitive science, and most recently computer science and artificial intelligence. Crudely, a rational agent is an entity that is capable of acting on its environment, and which chooses to act in such a way as to further its own best interests. There has recently been much interest in the use of mathematical logic for developing formal theories of such agents. Such theories view agents as practical reasoning (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  9.  1
    Reasoning About Coalitional Games.Thomas Ågotnes, Wiebe van der Hoek & Michael Wooldridge - 2009 - Artificial Intelligence 173 (1):45-79.
  10.  42
    Minds and Machines Special Issue: Ethics and Artificial Intelligence.Paula Boddington, Peter Millican & Michael Wooldridge - 2017 - Minds and Machines 27 (4):569-574.
  11. Quantified Coalition Logic.Thomas Ågotnes, Wiebe van der Hoek & Michael Wooldridge - 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 (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  26
    Reasoning About Social Choice Functions.Nicolas Troquard, Wiebe van der Hoek & Michael Wooldridge - 2011 - Journal of Philosophical Logic 40 (4):473-498.
    We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13.  29
    A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications.Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg & Michael Wooldridge - 2009 - Mathematical Logic Quarterly 55 (4):362-376.
    Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficiently compute solution concepts assuming such representations. Marginal contribution nets , introduced by Ieong and Shoham, are one of the simplest and most influential representation schemes for coalitional games. MC-nets are a rulebased formalism, in which rules take the form pattern → value, where “pattern ” is a Boolean condition over agents, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  1
    On the Computational Complexity of Qualitative Coalitional Games.Michael Wooldridge & Paul E. Dunne - 2004 - Artificial Intelligence 158 (1):27-73.
  15.  21
    Reasoning About Social Choice Functions.Nicolas Troquard, Wiebe Hoek & Michael Wooldridge - 2011 - Journal of Philosophical Logic 40 (4):473-498.
    We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  16.  15
    Reasoning About Equilibria in Game-Like Concurrent Systems.Julian Gutierrez, Paul Harrenstein & Michael Wooldridge - 2017 - Annals of Pure and Applied Logic 168 (2):373-403.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  35
    A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief.Michael Wooldridge, Clare Dixon & Michael Fisher - 1998 - Journal of Applied Non-Classical Logics 8 (3):225-258.
    ABSTRACT In this paper we define two logics, KLn and BLn, and present tableau-based decision procedures for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar; it is a temporal logic that contains connectives for representing the beliefs of agents. In addition to a complete formal definition of the (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  18.  32
    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 (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19.  15
    Cooperation, Knowledge, and Time: Alternating-Time Temporal Epistemic Logic and Its Applications.Wiebe van Der Hoek & Michael Wooldridge - 2003 - Studia Logica 75 (1):125-157.
    Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as "Alternating-time Temporal Logic". The key insight in (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  20.  12
    A Logical Characterisation of Qualitative Coalitional Games.Paul E. Dunne, Wiebe van der Hoek & Michael Wooldridge - 2007 - Journal of Applied Non-Classical Logics 17 (4):477-509.
    Qualitative coalitional games were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goal to achieve, and in which agents must typically cooperate with others in order to satisfy their goals. In this paper, we show how it is possible to reason about QCGs using Coalition Logic, a formalism intended to facilitate reasoning about coalitional powers in game-like multiagent systems. We introduce a correspondence relation between QCGs (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  33
    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 (2 more)  
     
    Export citation  
     
    Bookmark  
  22. Logic and the Foundations of Game and Decision Theory.Giacomo Bonanno, Wiebe van der Hoek & Michael Wooldridge (eds.) - 2008 - Amsterdam University Press.
    Translate
     
     
    Export citation  
     
    Bookmark  
  23.  26
    Partial-Order Boolean Games: Informational Independence in a Logic-Based Model of Strategic Interaction.Julian Bradfield, Julian Gutierrez & Michael Wooldridge - 2016 - Synthese 193 (3):781-811.
    As they are conventionally formulated, Boolean games assume that players make their choices in ignorance of the choices being made by other players – they are games of simultaneous moves. For many settings, this is clearly unrealistic. In this paper, we show how Boolean games can be enriched by dependency graphs which explicitly represent the informational dependencies between variables in a game. More precisely, dependency graphs play two roles. First, when we say that variable x depends on variable y, then (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  24. Solving Coalitional Resource Games.Paul E. Dunne, Sarit Kraus, Efrat Manisterski & Michael Wooldridge - 2010 - Artificial Intelligence 174 (1):20-50.
  25. The Complexity of Contract Negotiation.Paul E. Dunne, Michael Wooldridge & Michael Laurence - 2005 - Artificial Intelligence 164 (1-2):23-46.
  26. Weighted Argument Systems: Basic Definitions, Algorithms, and Complexity Results.Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons & Michael Wooldridge - 2011 - Artificial Intelligence 175 (2):457-486.
  27. An Agenda-Based Framework for Multi-Issue Negotiation.Shaheen S. Fatima, Michael Wooldridge & Nicholas R. Jennings - 2004 - Artificial Intelligence 152 (1):1-45.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28. A Linear Approximation Method for the Shapley Value.Shaheen S. Fatima, Michael Wooldridge & Nicholas R. Jennings - 2008 - Artificial Intelligence 172 (14):1673-1699.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  36
    Multi-Modal CTL: Completeness, Complexity, and an Application.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^\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  
     
    Bookmark  
  30.  80
    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  
     
    Bookmark  
  31.  5
    Multi-Modal CTL: Completeness, Complexity, and an Application.Thomas Ågotnes, Wiebe Hoek, Juan Rodríguez-Aguilar, Carles Sierra & Michael Wooldridge - 2009 - Studia Logica 92 (1):1-26.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  32.  14
    Quantified Coalition Logic.Thomas Ågotnes, Wiebe Hoek & Michael Wooldridge - 2008 - Synthese 165 (2):269-294.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  21
    Manipulating Games by Sharing Information.John Grant, Sarit Kraus, Michael Wooldridge & Inon Zuckerman - 2014 - Studia Logica 102 (2):267-295.
    We address the issue of manipulating games through communication. In the specific setting we consider (a variation of Boolean games), we assume there is some set of environment variables, the values of which are not directly accessible to players; the players have their own beliefs about these variables, and make decisions about what actions to perform based on these beliefs. The communication we consider takes the form of (truthful) announcements about the values of some environment variables; the effect of an (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  34.  74
    Postulates for Revising BDI Structures.John Grant, Sarit Kraus, Donald Perlis & Michael Wooldridge - 2010 - Synthese 175 (S1):39-62.
    The process of rationally revising beliefs in the light of new information is a topic of great importance and long-standing interest in artificial intelligence. Moreover, significant progress has been made in understanding the philosophical, logical, and computational foundations of belief revision. However, very little research has been reported with respect to the revision of other mental states, most notably propositional attitudes such as desires and intentions. In this paper, we present a first attempt to formulate a general framework for understanding (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  35.  2
    Automated Temporal Equilibrium Analysis: Verification and Synthesis of Multi-Player Games.Julian Gutierrez, Muhammad Najib, Giuseppe Perelli & Michael Wooldridge - 2020 - Artificial Intelligence 287:103353.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  1
    From Model Checking to Equilibrium Checking: Reactive Modules for Rational Verification.Julian Gutierrez, Paul Harrenstein & Michael Wooldridge - 2017 - Artificial Intelligence 248:123-157.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  20
    Hard and Soft Preparation Sets in Boolean Games.Paul Harrenstein, Paolo Turrini & Michael Wooldridge - 2016 - Studia Logica 104 (4):813-847.
    A fundamental problem in game theory is the possibility of reaching equilibrium outcomes with undesirable properties, e.g., inefficiency. The economics literature abounds with models that attempt to modify games in order to avoid such undesirable properties, for example through the use of subsidies and taxation, or by allowing players to undergo a bargaining phase before their decision. In this paper, we consider the effect of such transformations in Boolean games with costs, where players control propositional variables that they can set (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  38. On the Evaluation of Election Outcomes Under Uncertainty.Noam Hazon, Yonatan Aumann, Sarit Kraus & Michael Wooldridge - 2012 - Artificial Intelligence 189:1-18.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  3
    Łukasiewicz Logics for Cooperative Games.Enrico Marchioni & Michael Wooldridge - 2019 - Artificial Intelligence 275:252-278.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. A Hybrid Exact Algorithm for Complete Set Partitioning.Tomasz Michalak, Talal Rahwan, Edith Elkind, Michael Wooldridge & Nicholas R. Jennings - 2016 - Artificial Intelligence 230:14-50.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41.  7
    Foreword.Sieuwert Otterloo, Michael Wooldridge & Peter Mcburney - 2006 - Synthese 149 (2):255-256.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  42.  5
    Knowledge Condition Games.Sieuwert Otterloo, Wiebe Hoek & Michael Wooldridge - 2006 - Journal of Logic, Language and Information 15 (4):425-452.
    Direct download  
     
    Export citation  
     
    Bookmark  
  43. Anytime Coalition Structure Generation in Multi-Agent Systems with Positive or Negative Externalities.Talal Rahwan, Tomasz Michalak, Michael Wooldridge & Nicholas R. Jennings - 2012 - Artificial Intelligence 186:95-122.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44. Coalition Structure Generation: A Survey.Talal Rahwan, Tomasz P. Michalak, Michael Wooldridge & Nicholas R. Jennings - 2015 - Artificial Intelligence 229:139-174.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. Forming K Coalitions and Facilitating Relationships in Social Networks.Liat Sless, Noam Hazon, Sarit Kraus & Michael Wooldridge - 2018 - Artificial Intelligence 259:217-245.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46.  43
    Foreword.Sieuwert Van Otterloo, Michael Wooldridge & Peter Mcburney - 2006 - Synthese 149 (2):255-256.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  47.  34
    Knowledge Condition Games.Sieuwert van Otterloo, Wiebe Van Der Hoek & Michael Wooldridge - 2006 - Journal of Logic, Language and Information 15 (4):425-452.
    Understanding the flow of knowledge in multi-agent protocols is essential when proving the correctness or security of such protocols. Current logical approaches, often based on model checking, are well suited for modeling knowledge in systems where agents do not act strategically. Things become more complicated in strategic settings. In this paper we show that such situations can be understood as a special type of game – a knowledge condition game – in which a coalition “wins” if it is able to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  48. Matthew Weiner and Nuel Belnap/How Causal Probabilities Might Fit Into Our Objectively Indeterministic World Mp Lynch/Zombies and the Case of the Phenomenal Pickpocket.Sieuwert van Otterloo & Michael Wooldridge - 2006 - Synthese 149 (1):577-578.
  49. On the Logic of Cooperation and Propositional Control.Wiebe van der Hoek & Michael Wooldridge - 2005 - Artificial Intelligence 164 (1-2):81-119.
  50. Temporal and Dynamic Logic.Frank Wolter & Michael Wooldridge - 2010 - Journal of the Indian Council of Philosophical Research 27 (1).
    We present an introductory survey of temporal and dynamic logics: logics for reasoning about how environments change over time, and how dynamic processes affect their environments.We begin by introducing the historical development of temporal and dynamic logic, starting with the seminal work of Prior. This leads to a discussion of the use of temporal and dynamic logic in computer science. We describe LTL, CTL, and PDL; three key formalisms used in computer science for reasoning about programs, and illustrate how these (...)
     
    Export citation  
     
    Bookmark  
1 — 50 / 56