-
14Propositional belief base update and minimal changeArtificial Intelligence 115 (1): 107-138. 1999.
-
23On the dynamics of institutional agreementsSynthese 171 (2): 321-355. 2009.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 inst…Read more
-
64On the Dynamics of Institutional AgreementsSynthese 171 (2). 2009.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…Read more
-
28Dynamic epistemic logics: promises, problems, shortcomings, and perspectivesJournal of Applied Non-Classical Logics 27 (3-4): 328-341. 2017.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.
-
25Introspective forgettingSynthese 169 (2): 405-423. 2009.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.
-
365Regression in Modal LogicJournal of Applied Non-Classical Logics 13 (2): 165-185. 2003.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.
-
8From ordering-based nonmonotonic reasoning to conditional logicsArtificial Intelligence 66 (2): 375-393. 1994.
-
22A lightweight epistemic logic and its application to planningArtificial Intelligence 298 (C): 103437. 2021.
-
39A short biography of Luis Fariñas del CerroJournal of Applied Non-Classical Logics 27 (3): 153-160. 2017.Near the end of 2015, Luis Fariñas del Cerro officially retired as directeur de recherche in the Centre National de Recherche Scientifique (CNRS) 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…Read more
-
31What groups do, can do, and know they can do: an analysis in normal modal logicsJournal of Applied Non-Classical Logics 19 (3): 261-289. 2009.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' (STIT), 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 (called Ldm). We start by recalling a…Read more
-
14Announcements to Attentive AgentsJournal of Logic, Language and Information 25 (1): 1-35. 2016.In public announcement logic it is assumed that all agents pay attention to the announcement. Weaker observational conditions can be modelled in action model logic. In this work, we propose a version of public announcement logic wherein it is encoded in the states of the epistemic model which agents pay attention to the announcement. This logic is called attention-based announcement logic. We give an axiomatization of the logic and prove that complexity of satisfiability is the same as that of p…Read more
-
97Computer-mediated trust in self-interested expert recommendationsAI and Society 25 (4): 413-422. 2010.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 interactio…Read more
-
110'Knowable' as 'known after an announcement'Review of Symbolic Logic 1 (3): 305-334. 2008.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 lo…Read more
-
14Frame-validity Games and Lower Bounds on the Complexity of Modal AxiomsLogic Journal of the IGPL 30 (1): 155-185. 2022.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.
-
18A translation from the modal logic of provability into K4Journal of Applied Non-Classical Logics 4 (1): 73-77. 1994.No abstract
-
90Alternative axiomatics and complexity of deliberative stit theoriesJournal of Philosophical Logic 37 (4). 2008.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 w…Read more
-
39A logical formalization of the OCC theory of emotionsSynthese 168 (2): 201-248. 2009.In this paper, we provide a logical formalization of the emotion triggering process and of its relationship with mental attitudes, as described in Ortony, Clore, and Collins’s theory. We argue that modal logics are particularly adapted to represent agents’ mental attitudes and to reason about them, and use a specific modal logic that we call Logic of Emotions in order to provide logical definitions of all but two of their 22 emotions. While these definitions may be subject to debate, we show tha…Read more
-
91Conditionals: from philosophy to computer science (edited book)Oxford University Press. 1995.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.
-
36Public announcements, public assignments and the complexity of their logicJournal of Applied Non-Classical Logics 22 (3): 249-273. 2012.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 …Read more
-
140Introspective forgettingSynthese 169 (2): 405-423. 2009.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.
-
15Some modal aspects of XPathJournal of Applied Non-Classical Logics 20 (3): 139-171. 2010.This paper provides several examples of how modal logic can be used in studying the XML document navigation language XPath. More specifically, we derive complete axiomatizations, computational complexity and expressive power results for XPath fragments from known results for corresponding logics. A secondary aim of the paper is to introduce XPath in a way that makes it accessible to an audience of modal logicians.
-
Centre National de la Recherche ScientifiqueInstitut de Recherche En Informatique de Toulouse (IRIT)Regular Faculty
Universiti Paul Sabatier
PhD, 1989
Areas of Specialization
Science, Logic, and Mathematics |
Areas of Interest
Science, Logic, and Mathematics |
Doxastic and Epistemic Logic |
Action Theory |
Intentions |
Agency |