Reasoning about noisy sensors and effectors in the situation calculus
Artificial Intelligence
The logic of knowledge bases
Modal and temporal properties of processes
Modal and temporal properties of processes
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Knowledge, action, and the frame problem
Artificial Intelligence
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
What is planning in the presence of sensing?
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
The frame problem and knowledge-producing actions
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
| Hi-index | 0.00 |
We define the class of e-bounded theories in the epistemic situation calculus, where the number of fluent atoms that the agent thinks may be true is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We show that for them verification of an expressive class of first-order µ-calculus temporal epistemic properties is decidable. We also show that if the agent's knowledge in the initial situation is e-bounded and the objective part of an action theory maintains boundedness, then the entire epistemic theory is e-bounded.