The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Reasoning about knowledge
Modal logic
A Knowledge Based Semantics of Messages
Journal of Logic, Language and Information
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Synchronizing Diachronic Uncertainty
Journal of Logic, Language and Information
Characterizing perfect recall using next-step temporal operators in S5 Epistemic Temporal Logic
Journal of Logic and Computation
Hi-index | 0.00 |
Perfect recall, intuitively the ability to remember all past mental states, has been predominantly studied in the context of interpreted systems and game theory, which mostly consider S5 systems (of "correct" knowledge). More recently, the notion has become of interest to the epistemic logic community, where weaker systems are not unusual. Building upon recent work where we studied different definitions of perfect recall in Epistemic Temporal Logic (ETL), we argue that the intuitive motivations given there are still valid in such sub-S5 settings. However, definitions that were equivalent in S5 cease to be so without S5, so that these less restrictive settings allow for a more fine-grained comparison of the different definitions and their underlying intuitions.