کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
422721 | 685134 | 2015 | 18 صفحه PDF | دانلود رایگان |
Knowledge, belief, and evidence are fundamental notions which appear in a wide range of areas. Over the last decade epistemic reasoning with justifications has broadened even more the scope of applications of epistemic logic as agents gained the ability to not only reason about epistemic states of knowledge and belief of agents, but also to track their justifications and to sort those which are pertinent to given facts and sufficient for epistemic conclusions.This paper extends realization algorithm for S4-to-LP case to -to-S4nLP case. It converts cut-free derivations in into derivations in the corresponding Justification Logic S4nLP where witnesses of knowledge, the justification terms, are recovered for all instances of justified common knowledge. The algorithm was implemented in the MetaPRL framework and was tested on several well-known epistemic puzzles, such as Muddy Children, Surprise Examination Paradox, etc.
Journal: Electronic Notes in Theoretical Computer Science - Volume 312, 24 April 2015, Pages 143-160