What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
Reasoning about knowledge
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Interacting Explicit Evidence Systems
Theory of Computing Systems
Fields of logic and computation
Partial realization in dynamic justification logic
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
An Application of Justification Logic to Protocol Verification
CIS '11 Proceedings of the 2011 Seventh International Conference on Computational Intelligence and Security
Public communication in justification logic
Journal of Logic and Computation
| Hi-index | 0.00 |
In this paper, we introduce justification counterparts of distributed knowledge logics. Our justification logics include explicit knowledge operators of the form [[t]]_iF and $[[t]]_{\mathcal D} F$, which are interpreted respectively as "t is a justification that agent i accepts for F", and "t is a justification that all agents implicitly accept for F". We present Kripke style models and prove the completeness theorem. Finally, we give a semantical proof of the realization theorem.