Epistemic logic has grown from its philosophical beginnings to find diverse applications in computer science, and as a means of reasoning about the knowledge and belief of agents. This book provides a broad introduction to the subject, along with many exercises and their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the context of distributed systems and (...) artificial intelligence. These include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The authors also discuss extensively the problem of logical omniscience. They cover Halpern & Moses' theory of honest formulas, and they make a digression into the realm of nonmonotonic reasoning and preferential entailment. They discuss Moore's autoepistemic logic, together with Levesque's related logic of "all I know". Furthermore, they show how one can base default and counterfactual reasoning on epistemic logic. Graduate students in philosophy or in computer science, especially those with an interest in AI, will find this book useful. (shrink)

A useful logic in which to specify normative system behaviour, deontic logic has a broad spectrum of possible applications within the field: from legal expert systems to natural language processing, database integrity to electronic contracting and the specification of fault-tolerant software.

Many philosophers are convinced that rationality dictates that one’s overall set of intentions be consistent. The starting point and inspiration for our study is Bratman’s planning theory of intentions. According to this theory, one needs to appeal to the fulfilment of characteristic planning roles to justify norms that apply to our intentions. Our main objective is to demonstrate that one can be rational despite having mutually inconsistent intentions. Conversely, it is also shown that one can be irrational despite having a (...) consistent overall set of intentions. To overcome this paradox, we argue that it is essential for a successful planning system that one’s intentions are practically consistent rather than being consistent or applying an aggregation procedure. Our arguments suggest that a new type of norm is needed: whereas the consistency requirement focuses on rendering the contents of one’s intentions consistent, our new practical consistency requirement demands that one’s intentions be able to simultaneously and unconditionally guide one’s action. We observe that for intentions that conform to the ‘own-action condition’, the practical consistency requirement is equivalent to the traditional consistency requirement. This implies that the consistency requirement only needs to be amended in scenarios of choice under uncertainty. (shrink)

This paper formalizes part of a well-known psychological model of emotions. In particular, the logical structure underlying the conditions that trigger emotions are studied and then hierarchically organized. The insights gained therefrom are used to guide a formalization of emotion triggers, which proceeds in three stages. The first stage captures the conditions that trigger emotions in a semiformal way, i.e., without committing to an underlying formalism and semantics. The second stage captures the main psychological notions used in the emotion model (...) in dynamic doxastic logic. The third stage introduces a BDI-based framework (belief–desire–intention) with achievement goals, which is used to firmly ground the preceding stages. The result is a formalization of emotion triggers for BDI agents with achievement goals. The idea of proceeding in these stages is to provide different levels of commitment to formalisms, so that it remains relatively easy to extend or replace the used formalisms without having to start from scratch. Finally, we show that the formalization renders properties of emotions that are in line with the psychological model on which it is based. (shrink)

We present a model-theoretic approach for reasoning about security protocols, applying recent insights from dynamic epistemic logics. This enables us to describe exactly the subsequent epistemic states of the agents participating in the protocol, using Kripke models and transitions between these based on updates of the agent's beliefs associated with steps in the protocol. As a case study we will consider the SRA Three Pass protocol and discuss the Wide-Mouthed Frog protocol.

We give a model for iterated belief change in multi-agent systems. The formal tool we use for this is a combination of modal and dynamic logic. Two core notions in our model are the expansion of the knowledge and beliefs of an agent, and the processing of new information. An expansion is defined as the change in the knowledge and beliefs of an agent when it decides to believe an incoming formula while holding on to its current propositional beliefs. To (...) prevent our agents from forming inconsistent beliefs they do not expand with every piece of information they receive. Instead, our agents remember their original beliefs and every piece of information they receive. After every receipt of information they decide which subset of the received information should be incorporated into their original beliefs. This procedure is called the processing of new information. We show that our model of belief update behaves in an intuitive way and that it is not sensitive to criticism on comparable models. (shrink)

The aim of the work is to provide a language to reason about Closed Interactions, i.e. all those situations in which the outcomes of an interaction can be determined by the agents themselves and in which the environment cannot interfere with they are able to determine. We will see that two different interpretations can be given of this restriction, both stemming from Pauly Representation Theorem. We will identify such restrictions and axiomatize their logic. We will apply the formal tools to (...) reason about games and their regulation. (shrink)

To adequately deal with unpredictable and dynamic environments, normative frameworks typically deployed in mechanisms for modifying the norms at runtime are crucial. We present the syntax and operational semantics of programming constructs to facilitate runtime norm modification, allowing a programmer to specify when and how the norms may be changed by external agents or by the normative mechanism. The norms take on the form of conditional obligations and prohibitions, instantiating obligations and prohibitions. We present rule-based constructs for runtime modification of (...) the norms and their instances, and a mechanism for automatically updating the instances when their underlying norms change. Moreover, we investigate a mechanism for avoiding norm conflicts. (shrink)

We demonstrate ways to incorporate nondeterminism in a system designed to formalize the reasoning of agents concerning their abilities and the results of the actions that they may perform. We distinguish between two kinds of nondeterministic choice operators: one that expresses an internal choice, in which the agent decides what action to take, and one that expresses an external choice, which cannot be influenced by the agent. The presence of abilities in our system is the reason why the usual approaches (...) towards nondeterminism cannot be used here. The semantics that we define for nondeterministic actions is based on the idea that composite actions are unravelled in the strings of atomic actions and tests that constitute them. The main notions used in defining this semantics are finite computation sequences and finite computation runs of actions. The results that we obtain meet our intuitions regarding events and abilities in the presence of nondeterminism. (shrink)

In social interactions, it is common for individuals to possess different amounts of knowledge about a specific transaction, and those who are more knowledgeable might perform opportunistic behavior to others in their interest, which promotes their value but demotes others’ value. Such a typical social behavior is called opportunistic behavior. In this paper, we propose a formal account of opportunism based on the situation calculus. We first propose a model of opportunism that only considers a single action between two agents, (...) and then extend it to multiple actions and incorporate social context in the model. A simple example of selling a broken cup is used to illustrate our models. Through our models, we can have a thorough understanding of opportunism. (shrink)

In Multi Agent Systems it is often the case that individual preferences are not compatible and coalitions compete to achieve a given result. The paper presents a language to talk about the conflict between coalitional choices and it expresses deontic notions to evaluate them. We will be specifically concerned with cases where the collective perspective is at odds with the individual perspective.

We present an epistemic default logic, based on the metaphore of a meta-level architecture. Upward reflection is formalized by a nonmonotonic entailment relation, based on the objective facts that are either known or unknown at the object level. Then, the meta (monotonic) reasoning process generates a number of default-beliefs of object-level formulas. We extend this framework by proposing a mechanism to reflect these defaults down. Such a reflection is seen as essentially having a temporal flavour: defaults derived at the meta-level (...) are projected as facts in a next object level state. In this way, we obtain temporal models for default reasoning in meta-level formalisms which can be conceived as labeled branching trees. Thus, descending the tree corresponds to shifts in time that model downward reflection, whereas the branching of the tree corresponds to ways of combining possible defaults. All together, this yields an operational or procedural semantics of reasoning by default, which admits one to reason about it by means of branching-time temporal logic. Finally, we define sceptical and credulous entailment relations based on these temporal models and we characterize Reiter extensions in our semantics. (shrink)