This article discusses the arguments against associating epistemic responsibility with the ordinary notion of agency. I examine the various “Kantian” views which lead to a distinctive conception of epistemic agency and epistemic responsibility, in particular the one proposed by Pamela Hieronymi (2007). I try to explain why we can be held responsible for our beliefs in the sense of obeying norms...

If I were to believe you are trustworthy just on your say-so, my reasoning would be infected with what is called epistemic circularity. I would be supposing a source is trustworthy by relying on that very source. Generally speaking, we tend to think this is a very bad idea. It is why we don’t bother asking politicians or salesmen whether they are honest. A well-known line of reasoning stemming ...

The computability power of a distributed computing model is determined by the communication media available to the processes, the timing assumptions about processes and communication, and the nature of failures that processes can suffer. In a companion paper we showed how dynamic epistemic logic can be used to give a formal semantics to a given distributed computing model, to capture precisely ...

Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents’ epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and ...

This paper takes a dynamical systems perspective on the semantic structures of dynamic epistemic logic (DEL) and asks the question which orbits DEL-based dynamical systems may produce. The class of dynamical systems based directly on action models produce very limited orbits. Three types of more complex model transformers are equivalent and may produce a large class of orbits, suitable for most...

This paper addresses and solves the long-standing open problem of whether Group Announcement Logic (GAL) is decidable. GAL is a dynamic epistemic logic for reasoning about which states of knowledge a group of agents can make come about by sharing their knowledge, with an operator for quantifying over all truthful public announcements that can be made by the group. We show that the satisfiabilit...

In this paper I combine the dynamic epistemic logic of Gerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The result is a new probabilistic dynamic epistemic logic, a logic for reasoning about probability, information, and information change that takes higher order information into account. Probabilistic epistemic models are defined, and a way to build them for applicati...

Justification Logic is the study of a family of logics used to reason about justified true belief. Dynamic Epistemic Logic is the study of a family of logics obtained by adding various kinds of communication to the language of multi-modal logic, yielding languages for reasoning about communication and true belief. This paper is a first-step in merging these two areas, in that it brings the most...

We examine a version of the surprise examination paradox using dynamic epistemic logic. We claim that the difficulties in the puzzle arise from the assumption that announcements are in general successful: the hearer will come to believe that they are true. This principle fails in certain specific cases, and we show that the announcement in the surprise exam paradox is an example. In dynamic epi...

This paper surveys the interface between the two major logical trends that describe agents’ intelligent interaction over time: dynamic epistemic logic (DEL) and epistemic temporal logic (ETL). The initial attempt to “merge” DEL and ETL was made in [12] and followed up by [11] and [29]. The merged framework provides a systematic comparison between these two logical systems and studies new logics...