1 October 2008 in The Review of Symbolic Logic
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: ⋄φ expresses that there is a truthful announcement ψ after which φ is true. This logic gives a perspective on Fitch's knowability issues: For which formulas φ, 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.
24 February 2009 in Synthese
24 December 2009 in Logic Journal of the IGPL
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 (C&F). 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.
12 February 2008 in Journal of Philosophical Logic
18 October 2016 in KI - Künstliche Intelligenz
21 November 2008 in Journal of Logic and Computation
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In this article, we propose a labelled tableau calculus for this logic, and show that it decides satisfiability of formulas in deterministic polynomial space. Since this problem is known to be PSPACE-complete, it follows that our proof method is optimal.