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 (...) its completeness for a rather expressive subset. As for the constructs left outside this completely axiomatised subset, we present axioms by which they can be defined in the subset on the class of models in which every state has finitely many successors and give a complete axiomatisation for a “flat” subset of the logic with these constructs included. (shrink)

Logics of joint strategic ability have recently received attention, with arguably the most influential being those in a family that includes Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). Notably, both CL and ATL bypass the epistemic issues that underpin Schelling-type coordination problems, by apparently relying on the meta-level assumption of (perfectly reliable) communication between cooperating rational agents. Yet such epistemic issues arise naturally in settings relevant to ATL and CL: these logics are standardly interpreted on structures where agents move (...) simultaneously, opening the possibility that an agent cannot foresee the concurrent choices of other agents. In this paper we introduce a variant of CL we call Two-Player Strategic Coordination Logic (SCL2). The key novelty of this framework is an operator for capturing coalitional ability when the cooperating agents cannot share strategic information. We identify significant differences in the expressive power and validities of SCL2 and CL2, and present a sound and complete axiomatization for SCL2. We briefly address conceptual challenges when shifting attention to games with more than two players and stronger notions of rationality. (shrink)

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

This paper deals with the problem of verification of game-like structures by means of symbolic model checking. Alternating-time Temporal Epistemic Logic (ATEL) is used for expressing properties of multi-agent systems represented by alternating epistemic temporal systems as well as concurrent epistemic game structures. Unbounded model checking (a SAT based technique) is applied for the first time to verification of ATEL. An example is given to show an application of the technique.

``Pluralistic ignorance'' is a phenomenon mainly studied in social psychology. Viewed as an epistemic phenomenon, one way to define it is as a situation where ``no one believes, but everyone believes that everyone else believes''. In this paper various versions of pluralistic ignorance are formalized using epistemic/doxastic logic. The motive is twofold. Firstly, the formalizations are used to show that the various versions of pluralistic ignorance are all consistent, thus there is nothing in the phenomenon that necessarily goes against logic. (...) Secondly, pluralistic ignorance, is on many occasions, assumed to be fragile. In this paper, however, it is shown that pluralistic ignorance need not be fragile to announcements of the agents' beliefs. Hence, to dissolve pluralistic ignorance in general, something more than announcements of the subjective views of the agents is needed. Finally, suggestions to further research are outlined. (shrink)

The paper develops a set of quantified temporal alethic boulesic doxastic systems. Every system in this set consists of five parts: a ‘quantified’ part, a temporal part, a modal (alethic) part, a boulesic part and a doxastic part. There are no systems in the literature that combine all of these branches of logic. Hence, all systems in this paper are new. Every system is defined both semantically and proof-theoretically. The semantic apparatus consists of a kind of$$T \times W$$T×Wmodels, and the (...) proof-theoretical apparatus of semantic tableaux. The ‘quantified part’ of the systems includes relational predicates and the identity symbol. The quantifiers are, in effect, a kind of possibilist quantifiers that vary over every object in the domain. The tableaux rules are classical. The alethic part contains two types of modal operators for absolute and historical necessity and possibility. According to ‘boulesic logic’ (the logic of the will), ‘willing’ (‘consenting’, ‘rejecting’, ‘indifference’ and ‘non-indifference’) is a kind of modal operator. Doxastic logic is the logic of beliefs; it treats ‘believing’ (and ‘conceiving’) as a kind of modal operator. I will explore some possible relationships between these different parts, and investigate some principles that include more than one type of logical expression. I will show that every tableau system in the paper is sound and complete with respect to its semantics. Finally, I consider an example of a valid argument and an example of an invalid sentence. I show how one can use semantic tableaux to establish validity and invalidity and read off countermodels. These examples illustrate the philosophical usefulness of the systems that are introduced in this paper. (shrink)

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?

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations. (shrink)

IntroductionA quick glance at the opening paragraphs in many of the classic logic textbooks reveals a common view: Logical methods highlight the reasoning patterns of a single agent engaged in some form of mathematical thinking.A sampling from my bookshelf: Shoenfield’s Mathematical Logic: “Logic is the study of reasoning; and mathematical logic is the study of the type of reasoning done by mathematicians”; Enderton’s A Mathematical Introduction of Logic: “Symbolic logic is a mathematical model of deductive thought”; and Chiswell and Hodges (...) Mathematical Logic: “In this course we shall study some ways of proving statements.” However, this traditional view of the “subject matter” of logic is expanding. There is a growing literature using phrases such as “rational interaction” or “information flow” to describe its subject matter while still employing traditional logical methods. The clearest example of this can be found in the work of Johan van Benthem and others on l .. (shrink)

Contemporary epistemological and cognitive studies, as well as recent trends in computer science and game theory have revealed an increasingly important and intimate relationship between Information, Interaction, and Agency. Agents perform actions based on the available information and in the presence of other interacting agents. From this perspective Information, Interaction, and Agency neatly ties together classical themes like rationality, decision-making and belief revision with games, strategies and learning in a multi-agent setting. Unified by the central notions Information, Interaction, and Agency, (...) the essays in this volume provide refreshing methodological perspectives on belief revision, dynamic epistemic logic, von Neumann games, and evolutionary game theory; all of which in turn are central approaches to understanding our own rationality and that of other agents. (shrink)

We review the stit semantic framework and the main stit operators that have been proposed by Belnap, Perloff and Horty , a theory that has recently attracted the attention of the multiagent community. We discuss the problem of how to model the notion of collective agency, both in the sense of a joint action of a group of agents and as the agency of collective entities, like organisations. We show how we can define the direct and immediate effects of agents’ (...) actions, both in the achievement sense and in the deliberative sense, without any assumptions on the nature of time and considering the particular case of a discrete time. Finally, we also show how we can define a kind of dynamic logic operator that allows us to express what would obtain, if a direct “sees to it” action is performed, seeing it as a particular case of formulae of the form [a: φ]Ψ, that have the following informal meaning: “if agent a selects an action that leads to the truth of φ, after such action is performed, Ψ is the case”. (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)