Artificial intelligence and mathematical theory of computation
Reasoning about knowledge
Reasoning about noisy sensors and effectors in the situation calculus
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
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
Knowledge, action, and the frame problem
Artificial Intelligence
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Complexity and succinctness of public announcement logic
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Property persistence in the situation calculus
Artificial Intelligence
The Situation Calculus: A Case for Modal Logic
Journal of Logic, Language and Information
Iterated belief change in the situation calculus
Artificial Intelligence
McCarthy variations in a modal key
Artificial Intelligence
Alternating-time temporal announcement logic
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Hi-index | 0.01 |
We show how in the propositional case both Reiter's and Scherl & Levesque's solutions to the frame problem can be modelled in dynamic epistemic logic (DEL), and provide an optimal regression algorithm for the latter. Our method is as follows: we extend Reiter's framework by integrating observation actions and modal operators of knowledge, and encode the resulting formalism in DEL with announcement and assignment operators. By extending Lutz' recent satisfiability-preserving reduction to our logic, we establish optimal decision procedures for both Reiter's and Scherl & Levesque's approaches: satisfiability is NP-complete for one agent, PSPACE-complete for multiple agents and EXPTIME-complete when common knowledge is involved.