Abstract
In this paper, we introduce justification counterparts of distributed knowledge logics. Our justification logics include explicit knowledge operators of the form [[t]] iF and , 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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Ghari, M. (2012). Distributed knowledge with justifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7415 LNCS, pp. 91–108). https://doi.org/10.1007/978-3-642-31467-4_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
