Artificial intelligence and mathematical theory of computation
Reasoning about knowledge
Modal logic
A Logic for Planning under Partial Observability
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
The frame problem and knowledge-producing actions
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
A Tableau Method for Public Announcement Logics
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Dynamic epistemic algebra with post-conditions to reason about robot navigation
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.01 |
We present a reasoning about actions framework based on a sum of epistemic logic S5 and propositional dynamic logic PDL together with a ‘no forgetting’ principle, also called perfect recall. We show that in our framework an action may be decomposed into a purely ontic action followed by a purely epistemic action. We also show that the latter is completely definable in terms of simple observations, i.e., ‘test that’ actions and that they are equivalent to public announcements of public announcement logic PAL as studied by Plaza, van Benthem and others. Finally, since these actions respect ‘no learning’ principle we show that a unified reduction method based on regression, as studied by Reiter, applies.