Comparing semantics for temporal STIT logic

In this paper we establish equivalence results for the different semantics for the temporal STIT logic T-STIT, that includes temporal operators and the group agency operator for the grand coalition, and we study a semantics for temporal STIT that is based on the concept of interpreted system à la Fagin et al. We discuss the descriptive adequacy of the above semantics in capturing a given game-theoretical scenario where information about the players is included, and we compare them with traditional BT+AC semantics. Also, we discuss the extension of T-STIT with full groups and the corresponding operators, and we discuss the distinction between frames that impose additivity and superadditivity on the choices of arbitrary groups

Modal Action Logics for Reasoning about Reactive Systems

Meyer, J-.J.Ch. [Promotor]Riet, R.P. [Promotor]van de Wieringa, R. [Promotor

Logiques pour les réseaux sociaux : annonces asynchrones dans des structures orthogonales

Cette thèse a deux objets d'étude principaux. D'une part, nous proposons et étudions des modèles de transmission et de réception asynchrones de messages. Pour cela, nous nous plaçons dans le cadre des logiques épistémiques dynamiques - un sous-domaine de la logique modale qui formalise les états épistémiques d'un agent (i.e. ce que l'agent sait) et qui caractérise la façon dont ces états évoluent en différentes circonstances. La plus connue des logiques épistémiques dynamiques est la logique des annonces publiques (Plaza, 1989) - une logique dynamique qui considère comme action de base l'action d'effectuer une annonce publique. Dans un système multi-agent, il est dans la connaissance commune des agents que les messages sont reçus par tous les agents au même instant. Dans le chapitre principal de la thèse, nous proposons un modèle d'annonces asynchrones dans lequel les agents peuvent recevoir les annonces à différents instants tout en ignorant si les autres agents ont également reçu ces annonces. D'autre part, nous étudions une classe de structures relationnelles qui apparaissent assez souvent en logique modale : la classe des cadres orthogonaux. Les cadres orthogonaux sont des structures birelationnelles dans lesquelles deux composantes connexes arbitraires déterminées par les deux relations ont au plus un élément en commun. Pour différentes restrictions de la classe des cadres orthogonaux, nous proposons des axiomatisations correctes et complètes des ensembles de formules valides que ces restrictions déterminent et nous proposons quelques résultats de décidabilité de ces ensembles. Pour illustrer l'ubiquité des cadres orthogonaux, nous proposons des exemples de classes de modèles pour les logiques modales qui sont basées sur eux et nous montrons comment les résultats de la thèse peuvent être utilisés pour étudier ces classes du point de vue de leur orthogonalité. Enfin, nous combinons les deux parties précédentes dans le contexte de la logique épistémique sociale (Seligman et al., 2011). Il s'agit d'une logique développée pour l'étude des états épistémiques des agents dans un réseau social. Nous proposons différentes extensions dynamiques de cette logique et, en particulier, nous modélisons la transmission d'annonces asynchrones dans un réseau social.This thesis has two main objects of study, closely related to each other. On the one hand, we provide and study models for asynchronous transmission and reception of messages. To do this, we utilize the framework of Dynamic Epistemic Logic, a branch of Modal Logic which studies the epistemic state of an agent (i.e. what they know) and how this state changes under several circumstances. One of the better known dynamic epistemic logics is Public Announcement Logic (Plaza, 1989), a logic which allows for a notion of recieving a message. In a multi-agent system, this message is received by all agents at the same time, and they all know that the others have received it. In the main chapter of this thesis, we provide a framework for asynchronous announcements, in which the agents might receive the message at different times and be uncertain whether others know the information contained within it. On the other hand, we study a class of relational structures for modal logics which show up quite often in different areas of the literature: this is the class of orthogonal frames. Orthogonal frames are bi-relational structures wherein two distinct points cannot be connected by both relations at the same time. We give a sound and complete logic of orthogonal frames under different restrictions, and we provide decidability results. To illustrate the ubiquity of these structures, we provide multiple examples of frameworks for modal logics which are based on orthogonal frames, and we use some of the results obtained earlier to show how one can further the study of these structures by focusing on their orthogonality. To finish up, we combine the two areas of study, by taking as a case study the orthogonal framework of Social Epistemic Logic (Seligman et al., 2011). This is a framework for studying the epistemic state of agents in a social network. We provide different dynamic extensions, and in particular we give a way to model the transmission of announcements asynchronously in a social networ

Logics of Responsibility

The study of responsibility is a complicated matter. The term is used in different ways in different fields, and it is easy to engage in everyday discussions as to why someone should be considered responsible for something. Typically, the backdrop of these discussions involves social, legal, moral, or philosophical problems. A clear pattern in all these spheres is the intent of issuing standards for when---and to what extent---an agent should be held responsible for a state of affairs. This is where Logic lends a hand. The development of expressive logics---to reason about agents' decisions in situations with moral consequences---involves devising unequivocal representations of components of behavior that are highly relevant to systematic responsibility attribution and to systematic blame-or-praise assignment. To put it plainly, expressive syntactic-and-semantic frameworks help us analyze responsibility-related problems in a methodical way. This thesis builds a formal theory of responsibility. The main tool used toward this aim is modal logic and, more specifically, a class of modal logics of action known as stit theory. The underlying motivation is to provide theoretical foundations for using symbolic techniques in the construction of ethical AI. Thus, this work means a contribution to formal philosophy and symbolic AI. The thesis's methodology consists in the development of stit-theoretic models and languages to explore the interplay between the following components of responsibility: agency, knowledge, beliefs, intentions, and obligations. Said models are integrated into a framework that is rich enough to provide logic-based characterizations for three categories of responsibility: causal, informational, and motivational responsibility. The thesis is structured as follows. Chapter 2 discusses at length stit theory, a logic that formalizes the notion of agency in the world over an indeterministic conception of time known as branching time. The idea is that agents act by constraining possible futures to definite subsets. On the road to formalizing informational responsibility, Chapter 3 extends stit theory with traditional epistemic notions (knowledge and belief). Thus, the chapter formalizes important aspects of agents' reasoning in the choice and performance of actions. In a context of responsibility attribution and excusability, Chapter 4 extends epistemic stit theory with measures of optimality of actions that underlie obligations. In essence, this chapter formalizes the interplay between agents' knowledge and what they ought to do. On the road to formalizing motivational responsibility, Chapter 5 adds intentions and intentional actions to epistemic stit theory and reasons about the interplay between knowledge and intentionality. Finally, Chapter 6 merges the previous chapters' formalisms into a rich logic that is able to express and model different modes of the aforementioned categories of responsibility. Technically, the most important contributions of this thesis lie in the axiomatizations of all the introduced logics. In particular, the proofs of soundness & completeness results involve long, step-by-step procedures that make use of novel techniques

Decidability and Expressivity of Ockhamist Propositional Dynamic Logics

International audienceOckhamist Propositional Dynamic Logic (OPDL) is a logic unifying the family of dynamic logics and the family of branching-time temporal logics, two families of logic widely used in AI to model reactive systems and multi-agent systems (MAS). In this paper, we present two variants of this logic. These two logics share the same language and differ only in one semantic condition. The first logic embeds Bundled CTLé while the second embeds CTLé. We provide a 2EXPTIME decision procedure for the satisfiability problem of each variant. The decision procedure for the first variant of OPDL is based on the elimination of Hintikka sets while the decision procedure for the second variant relies on automata