Epistemic trustworthiness is defi ned as a complex character state that supervenes on a relation between fi rstand second-order beliefs, including beliefs about others as epistemic agents. In contexts shaped by unjust power relations, its second-order components create a mutually supporting link between a defi ciency in epistemic character and unjust epistemic exclusion on the basis of group me...

Formal methods have provided us with tools to check both anonymity of protocols and – more specifically – receipt-freeness of voting protocols. One of the frameworks used for proving anonymity is epistemic logic. However, to the best of our knowledge, epistemic logic has never been used to prove receipt-freeness of voting protocols. Still, the concept of indistinguishability used in formalizing...

Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to uncertain inputs, is used to revise probabilistic epistemic states when new information is uncertain. This paper analyses the expressive power of two possibilistic counterparts of Jeffrey’s rule for modeling belief revision in intelligent agents. We s...

In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...

Bisimulation is an equivalence relation over Kripke models. It is often claimed, but little argued for, that bisimulation captures a ‘natural’ notion of similarity in epistemic semantics, in the sense that the differences between bisimilar models are, from an epistemic point of view, irrelevant. In this paper we examine three types of arguments pertaining to the view that bisimilar models are ‘...

We present a bounded model checking (BMC) approach to the verification of temporal epistemic properties of multi-agent systems. We extend the temporal logic CTL∗ by incorporating epistemic modalities and obtain a temporal epistemic logic that we call CTL∗K. CTL∗K logic is interpreted under the semantics of synchronous interpreted systems. Though CTL∗K is of great expressive power in both tempor...

We develop a formal account of complex group-level epistemic modalities in the situation calculus, with a particular focus on reasoning about common knowledge. Expressions involving common knowledge cannot be handled by standard regression techniques and are thus difficult to reason about effectively. Taking our cue from recent promising work in dynamic epistemic logic, we overcome this limitat...

Indexed epistemic logics constitute a well-structured class of quantified epistemic logics with great expressive power and a well-behaved semantics based on the notion of epistemic transition model. It follows that they generalize term-modal logics. As to proof theory, the only axiomatic system for which we have a completeness theorem is the minimal system Q.Ke, whether with classical or with f...

The paper proposes a bimodal logic that describes an interplay between coalition strategies and distributed knowledge. Unlike the existing literature, the paper assumes that a strategy must be not only executable but also verifiable. That is, the strategy of a coalition should be based only on the information distributively known by the coalition and the coalition must be able to verify the res...

The semantics of the linguistic modals is argued to be determined mainly by the power structure of the participants in the interaction. In the deontic uses of the modals, another determining factor is the expectations of the participants’ attitudes towards the relevant action. By viewing the evidence as a power in its own right, our analysis can be generalized to the epistemic uses in a coheren...