In this paper, we formulate some approaches to belief fusion and revision using epistemic logic semantics. Fusion operators considered in this paper are majority merging, arbitration, and general merging. Some modalities corresponding to belief fusion and revision operators are incorporated into epistemic logics. The Kripke semantics of these extended logics are presented. While most existing a...

This paper compares epistemic virtue from the viewpoints of Zagzebski and Mulla Sadra, aiming to determine the extent to which their viewpoints on epistemic virtue are similar. Zagzebski, the contemporary philosopher, considers epistemic virtue as the basis on which knowledge is interpreted. She sees epistemic virtue as a requirement for achieving knowledge. Mulla Sadra, the founder of Transcen...

Abstract In this paper, I take issue with the idea that Michel Foucault might be considered a theorist of epistemic injustice, and argue his philosophical premises are incompatible Miranda Fricker’s. Their main disagreement rests upon their divergent ways conceiving relationship between reason power, giving rise to contrasting forms normativity characterize critical projects. This can helpfully...

Experiments are commonly thought to have epistemic privilege over simulations. Two ideas underpin this belief: First, experiments generate greater inferential power than simulations, and second, simulations cannot surprise us the way experiments can. In this paper I argue that neither of these claims is true of experiments versus simulations in general. We should give up the common practice of ...

In this paper we modify the semantics of epistemic speci cations (and hence the answer set semantics of extended logic program and disjunctive databases) to allow for reasoning in the absence of domain{closure assumption. This modi cation increases the expressive power of the language and allows one to explicitly state the domain{closure and other assumptions about the domain of discourse in th...

While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...

In this paper, we develop an epistemic logic for specifying and reasoning about information flow on the underlying communication channels. By combining ideas from Dynamic Epistemic Logic (DEL) and Interpreted Systems (IS), our semantics offers a natural and neat way of modeling multi-agent communication scenarios with different assumptions about the observational power of agents. We relate our ...

While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...

In this paper, we develop an epistemic logic to specify and reason about the information flow on the underlying communication channels. By combining ideas from Dynamic Epistemic Logic (DEL) and Interpreted Systems (IS), our semantics offers a natural and neat way of modelling multi-agent communication scenarios with different assumptions about the observational power of agents. We relate our lo...