Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: after which , does it hold that Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events.
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 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)
We model the forgetting of propositional variables in a modal logical context where agents become ignorant and are aware of each others’ or their own resulting ignorance. The resulting logic is sound and complete. It can be compared to variable-forgetting as abstraction from information, wherein agents become unaware of certain variables: by employing elementary results for bisimulation, it follows that beliefs not involving the forgotten atom(s) remain true.
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)
In this work we propose an encoding of Reiter’s Situation Calculus solution to the frame problem into the framework of a simple multimodal logic of actions. In particular we present the modal counterpart of the regression technique. This gives us a theorem proving method for a relevant fragment of our modal logic.
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)
This book looks at the ways in which conditionals, an integral part of philosophy and logic, can be of practical use in computer programming. It analyzes the different types of conditionals, including their applications and potential problems. Other topics include defeasible logics, the Ramsey test, and a unified view of consequence relation and belief revision. Its implications will be of interest to researchers in logic, philosophy, and computer science, particularly artificial intelligence.
Traditionally, consistency is the only criterion for the quality of a theory in logic-based approaches to reasoning about actions. This work goes beyond that and contributes to the metatheory of actions by investigating what other properties a good domain description should have. We state some metatheoretical postulates concerning this sore spot. When all postulates are satisfied we call the action theory modular. Besides being easier to understand and more elaboration tolerant in McCarthy’s sense, modular theories have interesting properties. We point (...) out the problems that arise when the postulates about modularity are violated, and propose algorithmic checks that can help the designer of an action theory to overcome them. (shrink)
We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.
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)
We investigate a series of logics that allow to reason about agents' actions, abilities, and their knowledge about actions and abilities. These logics include Pauly's Coalition Logic CL, Alternating-time Temporal Logic ATL, the logic of ‘seeing-to-it-that', and epistemic extensions thereof. While complete axiomatizations of CL and ATL exist, only the fragment of the STIT language without temporal operators and without groups has been axiomatized by Xu. We start by recalling a simplification of the Ldm that has been proposed in previous (...) work, together with an alternative semantics in terms of standard Kripke models. We extend that semantics to groups via a principle of superadditivity, and give a sound and complete axiomatization that we call Ldm G. We then add a temporal ‘next' operator to Ldm G, and again give a sound and complete axiomatization. We show that Ldm G subsumes coalition logic CL. Finally, we extend these logics with standard S5 knowledge operators. This enables us to express that agents see to something under uncertainty about the present state or uncertainty about which action is being taken. We focus on the epistemic extension of X-Ldm G, noted E-X-Ldm G. In accordance with established terminology in the planning community, we call this extension of X-Ldm G the conformant X-Ldm G. The conformant X-Ldm G enables us to express that agents are able to perform a uniform strategy. We conclude that in that respect, our epistemic extension of X-Ldm G is better suited than epistemic extensions of ATL. (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)
We study the extension of public announcement logic PAL by public assignments, which we call PALA. Just as in the case of PAL, the standard procedure for deciding PALA validity, i.e. the use of so-called reduction axioms to translate PALA formulae into formulae in epistemic logic EL, may lead to exponential growth. In this paper, we show that such a price is not mandatory, for we provide a polynomial translation of PALA into EL. This is based on abbreviations of subformulae (...) by new propositional letters. Such optimal translation also enables us to show the computational complexity of the problem of deciding PALA validity, which turns out to be coNP-complete in the single-agent case and PSPACE-complete in the multiagent case. (shrink)
Near the end of 2015, Luis Fariñas del Cerro officially retired as directeur de recherche in the Centre National de Recherche Scientifique and became an Emeritus researcher of the CNRS. The present special issue is a Festschrift in his honour to celebrate Luis’s achievements in science, both as an outstanding scholar as well as a remarkable and highly successful organiser, administrator and leader in science and technology policy and management, in particular as the founder of the Journal of Applied Non-Classical (...) Logics. The issue contains 13 scientific contributions by 32 authors, among them Luis’s colleagues, former students and friends. Preceding versions of these papers were presented at the international workshop ‘Logical Reasoning and Computation’ that was held at IRITInstitut de Recherche en Informatique de Toulouse, Université Paul Sabatier, Toulouse, on 3–4 March 2016. The present introduction contains a short scientific biography describing the many different areas of logic and co... (shrink)
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)
Dynamic epistemic logics provide an account of the evolution of agents’ belief and knowledge when they learn the occurrence of an event. These logics started to become popular about 20 years ago and by now there exists a huge number of publications about them. The present paper briefly summarises the existing body of literature, discusses some problems and shortcomings, and proposes some avenues for future research.