This collection of essays by one of the most prominent and internationally respected philosophers of action theory is concerned with deepening our understanding of the notion of intention. In Bratman's view, when we settle on a plan for action we are committing ourselves to future conduct in ways that help support important forms of coordination and organization both within the life of the agent and interpersonally. These essays enrich that account of commitment involved in intending, and explore its implications for (...) our understanding of temptation and self-control, shared intention and shared cooperative activity, and moral responsibility. The essays offer extensive discussions of related views by, among others, Donald Davidson, Hector-Neri Castañeda, Christine Korsgaard, Harry Frankfurt, and P. F. Strawson. This collection will be a valuable resource for a wide range of philosophers and their students. (shrink)

This book provides the first comprehensive introduction to Dynamic Logic. Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical (...) first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular program. Other uses include determining the equivalence of programs, comparing the expressive power of various programming constructs, and synthesizing programs from specifications. This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter. (shrink)

This book offers original accounts of a number of central social phenomena, many of which have received little if any prior philosophical attention. These phenomena include social groups, group languages, acting together, collective belief, mutual recognition, and social convention. In the course of developing her analyses Gilbert discusses the work of Emile Durkheim, Georg Simmel, Max Weber, David Lewis, among others.

What happens to our conception of mind and rational agency when we take seriously future-directed intentions and plans and their roles as inputs into further practical reasoning? The author's initial efforts in responding to this question resulted in a series of papers that he wrote during the early 1980s. In this book, Bratman develops further some of the main themes of these essays and also explores a variety of related ideas and issues. He develops a planning theory of intention. Intentions (...) are treated as elements of partial plans of action. These plans play basic roles in practical reasoning, roles that support the organization of our activities over time and socially. Bratman explores the impact of this approach on a wide range of issues, including the relation between intention and intentional action, and the distinction between intended and expected effects of what one intends. (shrink)

You know that George W. Bush is the U.S. president, but you know how to ride a bicycle. What's the difference? According to intellectualists, not much: either knowing how to do something is a matter of knowing that something is the case or, at the very least, know-how requires a prior bit of theoretical knowledge. Anti-intellectualists deny this order of priority: either knowing-how and knowing-that are independent or, at the very least, knowing that something is the case requires a prior (...) bit of know-how. Much of the dispute centers on the relationship between knowing how to do something and having an ability to do it. If having an ability is necessary and sufficient for knowing-how, this is thought to provide comfort for anti-intellectualists. This paper traces the place of ability in the know-how/know-that debate from Ryle's seminal statement of anti-intellectualism through Stanley and Williamson's more recent defense of intellectualism. (shrink)

Abstract Orthodox decision theory presupposes that agency is invested in individuals. An opposing literature allows team agency to be invested in teams whose members use distinctive modes of team reasoning. This paper offers a new conceptual framework, inspired by David Lewis's analysis of common reasons for belief, within which team reasoning can be represented. It shows how individuals can independently endorse a principle of team reasoning which prescribes acting as a team member conditional on assurance that others have endorsed the (...) same principle. It argues that there can be such assurance even when no individual has an obligation to act on team reasoning. *This paper originated in a lecture that I gave at a Colloquium on Collective Intentions at Erasmus University Rotterdam. I thank participants, and particularly Govert den Hartogh, for comments. The analysis presented in this paper is an offshoot of a larger project, which uses David Lewis's work as the starting point for a reconstruction of the foundations of game theory. That project is joint work with Robin Cubitt. The specific idea of using this approach to analyse team reasoning grew out of a discussion with Michael Bratman. My work was supported by the Leverhulme Trust. (shrink)

This is a new release of the original 1949 edition.

This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...

We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the deliberative STIT. The second one starts from the idea that the historic necessity operator can be defined as an abbreviation of operators of agency, and can thus be eliminated from the logic of Chellas’s STIT. The second axiomatization also allows us to establish that the problem of deciding the satisfiability of a STIT formula without temporal operators (...) is NP-complete in the single-agent case, and is NEXPTIME-complete in the multiagent case, both for the deliberative and Chellas’s STIT. (shrink)

A selection function based semantics is offered for the 'can' of ability based on the idea that 'John can run a four minute mile' is true iff John would do so under the right conditions, meaning that he would do so under at least one appropriately chosen test condition. Completeness is proved for an axiom system and semantics based on this idea, and the logic turns out to be interestingly different from any standard system of modal logic.

A variety of logical frameworks have been developed to study rational agents interacting over time. This paper takes a closer look at one particular interface, between two systems that both address the dynamics of knowledge and information flow. The first is Epistemic Temporal Logic (ETL) which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event (...) models which may occur inside modalities of the language. This paper systematically and rigorously relates the DEL framework with the ETL framework. The precise relationship between DEL and ETL is explored via a new representation theorem characterizing the largest class of ETL models corresponding to DEL protocols in terms of notions of Perfect Recall , No Miracles , and Bisimulation Invariance . We then focus on new issues of completeness . One contribution is an axiomatization for the dynamic logic of public announcements constrained by protocols, which has been an open problem for some years, as it does not fit the usual ‘reduction axiom’ format of DEL. Finally, we provide a number of examples that show how DEL suggests an interesting fine-structure inside ETL. (shrink)

We present a modal logic called (logic of intention and attempt) in which we can reason about intention dynamics and intentional action execution. By exploiting the expressive power of , we provide a formal analysis of the relation between intention and action and highlight the pivotal role of attempt in action execution. Besides, we deal with the problems of instrumental reasoning and intention persistence.

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 (...) in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)

We prove completeness and decidability results for a family of combinations of propositional dynamic logic and unimodal doxastic logics in which the modalities may interact. The kind of interactions we consider include three forms of commuting axioms, namely, axioms similar to the axiom of perfect recall and the axiom of no learning from temporal logic, and a Church–Rosser axiom. We investigate the influence of the substitution rule on the properties of these logics and propose a new semantics for the test (...) operator to avoid unwanted side effects caused by the interaction of the classic test operator with the extra interaction axioms. (shrink)

This paper is roughly in two parts. The first deals with whether know-how is constituted by propositional knowledge, as discussed primarily by Gilbert Ryle (1949) The concept of mind. London: Hutchinson, Jason Stanley and Timothy Williamson (2001). Knowing how. Journal of Philosophy, 98, pp. 411–444 as well as Stephen Hetherington (2006). How to know that knowledge-that is knowledge-how. In S. Hetherington (Ed.) Epistemology futures. Oxford: Oxford University Press. The conclusion of this first part is that know-how sometimes does and sometimes (...) does not consist in propositional knowledge. The second part defends an analysis of know-how inspired by Katherine Hawley’ (2003). Success and knowledge-how. American Philosophical Quarterly, 40, pp. 19–31, insightful proposal that know-how requires counterfactual success. I conclude by showing how this analysis helps to explain why know-how sometimes does and sometimes does not consist of propositional knowledge. (shrink)

In this paper we show that the Hilbert system of agency and ability presented by Dag Elgesem is incomplete with respect to the intended semantics. We argue that completeness result may be easily regained. Finally, we shortly discuss some issues related to the philosophical intuition behind his approach. This is done by examining Elgesem's modal logic of agency and ability using semantics with different flavours.

In this paper we study substantive assumptions in social interaction. By substantive assumptions we mean contingent assumptions about what the players know and believe about each other’s choices and information. We first explain why substantive assumptions are fundamental for the analysis of games and, more generally, social interaction. Then we show that they can be compared formally, and that there exist contexts where no substantive assumptions are being made. Finally we show that the questions raised in this paper are related (...) to a number of issues concerning “large” structures in epistemic game theory. (shrink)

The Philosophy of Sociality offers new ideas and conceptual tools for philosophers and social scientists in their analysis of the social world.

We investigate the semantics of messages, and argue that the meaning ofa message is naturally and usefully given in terms of how it affects theknowledge of the agents involved in the communication. We note thatthis semantics depends on the protocol used by the agents, and thus not only the message itself, but also the protocol appears as a parameter in the meaning. Understanding this dependence allows us to give formal explanations of a wide variety of notions including language dependence, implicature, (...) and the amount of information in a message. (shrink)

We draw parallels between several closely related logics that combine — in different proportions — elements of game theory, computation tree logics, and epistemic logics to reason about agents and their abilities. These are: the coalition game logics CL and ECL introduced by Pauly 2000, the alternating-time temporal logic ATL developed by Alur, Henzinger and Kupferman between 1997 and 2002, and the alternating-time temporal epistemic logic ATEL by van der Hoek and Wooldridge (2002). In particular, we establish some subsumption and (...) equivalence results for their semantics, as well as interpretation of the alternating-time temporal epistemic logic into ATL. The focus in this paper is on models: alternating transition systems, multi-player game models (alias concurrent game structures) and coalition effectivity models turn out to be intimately related, while alternating epistemic transition systems share much of their philosophical and formal apparatus. Our approach is constructive: we present ways to transform between different types of models and languages. (shrink)

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 (...) systems, deciding moment by moment which action to perform next, given the beliefs they have about the world and their desires with respect to how they would like the world to be. In this article, we survey the state of the art in developing logical theories of rational agency. Following a discussion on the dimensions along which such theories can vary, we briefly survey the logical tools available in order to construct such theories. We then review and critically assess three of the best known theories of rational agency: Cohen and Levesque's intention logic, Rao and Georgeff's BDI logics, and the KARO framework of Meyer et al. We then discuss the various roles that such logics can play in helping us to engineer rational agents, and conclude with a discussion of open problems. (shrink)

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 (...) checking complexity. Finally, we study properties of constructive knowledge and other operators in this non-standard semantics. (shrink)

Most agents can acquire information about their environments as they operate. A good plan for such an agent is one that not only achieves the goal, but is also executable, i.e., ensures that the agent has enough information at every step to know what to do next. In this paper, we present a formal account of what it means for an agent to know how to execute a plan and to be able to achieve a goal. Such a theory is (...) a prerequisite for producing specifications of planners for agents that can acquire information at run time. It is also essential to account for cooperation among agents. Our account is more general than previous proposals, correctly handles programs containing loops, and incorporates a solution to the frame problem. It can also be used to prove programs containing sensing actions correct. (shrink)

We analyze extensive games as interactive process models, using modallanguages plus matching notions of bisimulation as varieties of gameequivalences. Our technical results show how to fit existing modalnotions into this new setting.

Epistemic protocols are communication protocols aiming at transfer of knowledge in a controlled way. Typically, the preconditions or goals for protocol actions depend on the knowledge of agents, often in nested form. Informal epistemic protocol descriptions for muddy children, coordinated attack, dining cryptographers, Russian cards, secret key exchange are well known. The contribution of this paper is a formal study of a natural requirement on epistemic protocols, that the contents of the protocol can be assumed to be common knowledge. By (...) formalizing this requirement we can prove that there can be no unbiased deterministic protocol for the Russian cards problem. For purposes of our formal analysis we introduce an epistemic protocol language, and we show that its model checking problem is decidable. (shrink)

We discuss games of both perfect and imperfect information at two levels of structural detail: players’ local actions, and their global powers for determining outcomes of the game. We propose matching logical languages for both. In particular, at the ‘action level’, imperfect information games naturally model a combined ‘dynamic-epistemic language’ – and we find correspondences between special axioms and particular modes of playing games with their information dynamics. At the ‘outcome level’, we present suitable notions of game equivalence, plus some (...) simple representation results. (shrink)