A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
Reasoning about knowledge
Modal logic
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Complexity and succinctness of public announcement logic
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Dynamic Epistemic Logic
Hi-index | 0.05 |
We introduce a variant of the standard epistemic logic S5 for reasoning about knowledge under hypotheses or background assumptions. The modal operator of necessity expressing what is known is parameterised with a hypothesis. The operator can be described as relative necessity, a notion already used by Chellas to describe conditionality. In fact, the parameterised box resembles a conditional operator and it turns out that our logic is a variant of Chellas' Conditional Logic. We present an axiomatisation of the logic and show that it bears the same expressivity and computational complexity as S5. Then we consider the extension of our logic with operators for distributed knowledge and show how it can be used to represent knowledge of agents whose epistemic capacity corresponds to any system between S4 and S5.