Topological reasoning and the logic of knowledge
TARK '92 Proceedings of the fourth conference on Theoretical aspects of reasoning about knowledge
Modal logic
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Topology and Knowledge of Multiple Agents
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
Dynamic Epistemic Logic
Simulation and Information: Quantifying over Epistemic Events
Knowledge Representation for Agents and Multi-Agent Systems
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Multi-agent subset space logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We give an alternative logic for knowability to arbitrary public announcement logic. In the new semantics, 'knowable' means 'known after an information update' rather than the more specific interpretation of 'known after an announcement'. An update is modelled by the refining of accessibility relations. We compare our logic to arbitrary announcement logic and subset space logic and thus establish a link between the latter two.