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.

We develop a conceptual and formal clarification of notion of surprise as a belief-based phenomenon by exploring a rich typology. Each kind of surprise is associated with a particular phase of cognitive processing and involves particular kinds of epistemic representations (representations and expectations under scrutiny, implicit beliefs, presuppositions). We define two main kinds of surprise: mismatch-based surprise and astonishment. In the central part of the paper we suggest how a formal model of surprise can be integrated with a formal model (...) of belief change. We investigate the role of surprise in triggering the process of belief reconsideration. There are a number of models of surprise developed in the psychology of emotion. We provide several comparisons of our approach with those models. (shrink)

The paper presents a new logic for reasoning about the formation of beliefs through perception or through inference in non-omniscient resource-bounded agents. The logic distinguishes the concept of explicit belief from the concept of background knowledge. This distinction is reflected in its formal semantics and axiomatics: we use a non-standard semantics putting together a neighborhood semantics for explicit beliefs and relational semantics for background knowledge, and we have specific axioms in the logic highlighting the relationship between the two concepts. Mental (...) operations of perceptive type and inferential type, having effects on epistemic states of agents, are primitives in the object language of the logic. At the semantic level, they are modelled as special kinds of model-update operations, in the style of dynamic epistemic logic. Results about axiomatization, decidability and complexity for the logic are given in the paper. (shrink)

In the literature there are at least two main formal structures to deal with situations of interactive epistemology: Kripke models and type spaces. As shown in many papers :149–225, 1999; Battigalli and Siniscalchi in J Econ Theory 106:356–391, 2002; Klein and Pacuit in Stud Log 102:297–319, 2014; Lorini in J Philos Log 42:863–904, 2013), both these frameworks can be used to express epistemic conditions for solution concepts in game theory. The main result of this paper is a formal comparison between (...) the two and a statement of semantic equivalence with respect to two different logical systems: a doxastic logic for belief and an epistemic–doxastic logic for belief and knowledge. Moreover, a sound and complete axiomatization of these logics with respect to the two equivalent Kripke semantics and type spaces semantics is provided. Finally, a probabilistic extension of the result is also presented. A further result of the paper is a study of the relationship between the epistemic–doxastic logic for belief and knowledge and the logic STIT by Belnap and colleagues. (shrink)

The aim of this paper, is to provide a logical framework for reasoning about actions, agency, and powers of agents and coalitions in game-like multi-agent systems. First we define our basic Dynamic Logic of Agency ( ). Differently from other logics of individual and coalitional capability such as Alternating-time Temporal Logic (ATL) and Coalition Logic, in cooperation modalities for expressing powers of agents and coalitions are not primitive, but are defined from more basic dynamic logic operators of action and (historic) (...) necessity. We show that STIT logic can be reconstructed in . We then extend with epistemic operators, which allows us to distinguish capability and power. We finally characterize the conditions under which agents are aware of their capabilities and powers. (shrink)

I present a variant of with time, called, interpreted in standard Kripke semantics. On the syntactic level, is nothing but the extension of atemporal individual by: the future tense and past tense operators, and the operator of group agency for the grand coalition. A sound and complete axiomatisation for is given. Moreover, it is shown that supports reasoning about interesting normative concepts such as the concepts of achievement obligation and commitment.

In this paper we propose a method for modeling social influence within the STIT approach to action. Our proposal consists in extending the STIT language with special operators that allow us to represent the consequences of an agent’s choices over the rational choices of another agent.

We continue the work initiated in Herzig and Lorini (J Logic Lang Inform, in press) whose aim is to provide a minimalistic logical framework combining the expressiveness of dynamic logic in which actions are first-class citizens in the object language, with the expressiveness of logics of agency such as STIT and logics of group capabilities such as CL and ATL. We present a logic called ( Deterministic Dynamic logic of Agency ) which supports reasoning about actions and joint actions of (...) agents and coalitions, and agentive and coalitional capabilities. In it is supposed that, once all agents have selected a joint action, the effect of this joint action is deterministic. In order to assess we prove that it embeds Coalition Logic. We then extend with modal operators for agents’ preferences, and show that the resulting logic is sufficiently expressive to capture the game-theoretic concepts of best response and Nash equilibrium. (shrink)

We analyze a recent trend in epistemic logic which consists in studying construction of knowledge from the agents’ observational abilities. It is based on the intuition that an agent’s knowledge comes from three possible sources: her observations, communication with other agents, and inference. The approaches mainly focus on the former two and suppose that the object of observations are propositional variables and that agents learn from public announcements. This allows to model knowledge in a more compact and intuitive way than (...) with Hintikka’s semantics. However, the semantics that one can find in the literature come with some counter-intuitive validities such as common knowledge of visibilities or the knowledge operator distributing over disjunctions. We propose a solution of each of these two issues and illustrate them with well-known toy examples of epistemic logic. (shrink)

The aim of this paper is to propose a formal approach to reasoning about desires, understood as logical propositions which we would be pleased to make true, also acknowledging the fact that desire is a matter of degree. It is first shown that, at the static level, desires should satisfy certain principles that differ from those to which beliefs obey. In this sense, from a static perspective, the logic of desires is different from the logic of beliefs. While the accumulation (...) of beliefs tend to reduce the remaining possible worlds they point at, the accumulation of desires tends to increase the set of states of affairs tentatively considered as satisfactory. Indeed beliefs are expected to be closed under conjunctions, while, in the positive view of desires developed here, one can argue that endorsing \ as a desire means to desire \ and to desire \. However, desiring \ and \ at the same time is not usually regarded as rational, since it does not make much sense to desire one thing and its contrary at the same time. Thus when a new desire is added to the set of desires of an agent, a revision process may be necessary. Just as belief revision relies on an epistemic entrenchment relation, desire revision is based on a hedonic entrenchment relation satisfying other properties, due to the different natures of belief and desire. While epistemic entrenchment relations are known to be qualitative necessity relations, hedonic relations obeying a set of reasonable postulates correspond to another set-function in possibility theory, called guaranteed possibility, that drive well-behaved desire revision operations. Then the general framework of possibilistic logic provides a syntactic setting for encoding desire change. The paper also insists that desires should be carefully distinguished from goals. (shrink)

The aim of this paper is to present a logical framework in which the concepts of trust and reputation can be formally characterized and their properties studied. We start from the definition of trust proposed by Castelfranchi & Falcone . We formalize this definition in a logic of time, action, beliefs and choices. Then, we provide a refinement of C&F’s definition by distinguishing two general types of trust: occurrent trust and dispositional trust. In the second part of the paper we (...) present a definition of reputation that is structurally similar to the definition of trust but moves the basic concept of belief to a collective dimension of group belief. (shrink)

This paper proposes a logical framework for representing static and dynamic properties of different kinds of individual and collective attitudes. A complete axiomatization as well as a decidability result for the logic are given. The logic is applied to game theory by providing a formal analysis of the epistemic conditions of iterated deletion of weakly dominated strategies (IDWDS), or iterated weak dominance for short. The main difference between the analysis of the epistemic conditions of iterated weak dominance given in this (...) paper and other analysis is that we use a semi-qualitative approach to uncertainty based on the notion of plausibility first introduced by Spohn, whereas other analysis are based on a quantitative representation of uncertainty in terms of probabilities. (shrink)

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\rm A}_{G:x} \varphi$$\end{document} reading ‘if the agents in the set of agents G identify themselves with institution x then they together accept that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varphi}$$\end{document} ’. We extend acceptance logic by two kinds of dynamic modal operators. The first (...) kind are public announcements of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${x!\psi}$$\end{document}, meaning that the agents learn that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\psi}$$\end{document} is the case in context x. Formulae of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${[x!\psi]\varphi}$$\end{document} mean that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varphi}$$\end{document} is the case after every possible occurrence of the event x!ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lnot\psi}$$\end{document} -worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${G:x\uparrow\psi}$$\end{document}. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called ‘doctrinal paradox’ or ‘discursive dilemma’ (Pettit, Philosophical Issues 11:268–299, 2001; Kornhauser and Sager, Yale Law Journal 96:82–117, 1986). (shrink)

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form $A_{Gx} \phi $ reading 'if the agents in the set of agents G identify themselves with institution x then they together accept that φ'. We extend acceptance logic by two kinds of dynamic modal operators. The first kind are public announcements of the form x!ψ, meaning that the agents learn that ψ is the case in (...) context x. Formulae of the form [x!ψ]φ mean that φ is the case after every possible occurrence of the event x!ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all ¬ψ-Worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form G:x↑ψ. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called 'doctrinal paradox' or 'discursive dilemma' (Pettit, Philosophical Issues 11: 268-299, 2001; Kornhauser and Sager, Yale Law Journal 96: 82-117, 1986). (shrink)

Important decisions are often based on a distributed process of information processing, from a knowledge base that is itself distributed among agents. The simplest such situation is that where a decision-maker seeks the recommendations of experts. Because experts may have vested interests in the consequences of their recommendations, decision-makers usually seek the advice of experts they trust. Trust, however, is a commodity that is usually built through repeated face time and social interaction and thus cannot easily be built in a (...) global world where we have immediate internet access to a vast pool of experts. In this article, we integrate findings from experimental psychology and formal tools from Artificial Intelligence to offer a preliminary roadmap for solving the problem of trust in this computer-mediated environment. We conclude the article by considering a diverse array of extended applications of such a solution. (shrink)

This handbook offers a deep analysis of the main forms of legal reasoning and argumentation from both a logical-philosophical and legal perspective. These forms are covered in an exhaustive and critical fashion, and the handbook accordingly divides in three parts: the first one introduces and discusses the basic concepts of practical reasoning. The second one discusses the main general forms of reasoning and argumentation relevant for legal discourse. The third one looks at their application in law as well as at (...) the different areas of legal reasoning. The handbook’s division in three parts reflects its conceptual architecture, since legal reasoning and argumentation are considered in relation to the more general types of reasoning. (shrink)

This paper investigates the influence that social ties can have on behavior. After defining the concept of social ties that we consider, we introduce an original model of social ties. The impact of such ties on social preferences is studied in a coordination game with outside option. We provide a detailed game theoretical analysis of this game while considering various types of players, i.e., self-interest maximizing, inequity averse, and fair agents. In addition to these approaches that require strategic reasoning in (...) order to reach some equilibrium, we also present an alternative hypothesis that relies on the concept of team reasoning. After having discussed the differences between the latter and our model of social ties, we show how an experiment can be designed so as to discriminate among the models presented in the paper. (shrink)

This LNCS book is part of the FOLLI book series and constitutes the proceedings of the 7th International Workshop on Logic, Rationality, and Interaction, LORI 2019, held in Chongqing, China, in October 2019. The 31 papers presented in this book were carefully reviewed and selected from 56 submissions. They focus on the following topics: agency; argumentation and agreement; belief revision and belief merging; belief representation; cooperation; decision making and planning; natural language; philosophy and philosophical logic; and strategic reasoning.

This book offers a widely interdisciplinary approach to investigating important questions surrounding the cognitive foundations of group attitudes and social interaction. The volume tackles issues such as the relationship between individual and group attitudes, the cognitive bases of group identity and group identification and the link between emotions and individual attitudes. This volume delves into the links between individual attitudes and how they are reflected in shared attitudes where common belief, collective acceptance, joint intentions, and group preferences come into play. (...) It pursues answers to the connections between trust and beliefs, goals and intentions and attempts to investigate questions such as: does trust have an affective component and how it may relate to hope and fear? The volume also scrutinizes game theory and questions whether it can satisfactorily explain and model social interaction and if there may be any concepts which are not addressed by the current theory. Contributors are derived from disciplines including philosophy, economics, psychology, logic and computer science. Interdisciplinary in scope and comprehensive detail, this volume integrates a variety of approaches – philosophical, psychological and artificial intelligence – to strategic, normative and emotional aspects of social interaction. (shrink)

We propose a minimal logic for interactive epistemology based on a qualitative representation of epistemic individual and group attitudes including knowledge, belief, strong belief, common knowledge and common belief. We show that our logic is sufficiently expressive to provide an epistemic foundation for various game-theoretic solution concepts including “1-round of deletion of weakly dominated strategies, followed by iterated deletion of strongly dominated strategies” ) and “2-rounds of deletion of weakly dominated strategies, followed by iterated deletion of strongly dominated strategies” ). (...) Axiomatization and complexity results for the logic are given in the paper. (shrink)

I propose a modal logic that enables to reason about self-regarding and otherregarding motivations in strategic games. This logic integrates the concepts of joint action, belief, individual and group payoff. The first part of the article is focused on self-regarding agents. A self-regarding agent decides to perform a certain action only if he believes that this action maximizes his own personal benefit. The second part of the article explores different kinds of other-regarding motivations such as fairness and reciprocity. Differently from (...) self-regarding agents, other-regarding agents also consider the benefits of their choices for the group. Moreover, their decisions can be affected by their beliefs about other agents' willingness to act for the well-being of the group. The analysis also considers team-directed reasoning, i.e. the mode of reasoning that people use when they take themselves to be acting as members of a group or a team. (shrink)

A theory of action is fundamental for legal theory, as the law is meant to direct behaviour: it influences the behaviour of agents who can understand the law’s prescriptions and act accordingly. A connection between law and action is assumed by the most diverse approaches to the law; when no reference is made to this connection it is since it appears to be an obvious truism. Let us list just a few examples where this connection appears most clearly.

In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to (...) rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research. (shrink)