Bounded Epistemic Situation Calculus Theories
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 846-852.
Abstract
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 mu-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.
@inproceedings{ijcai2013p131,
title = {Bounded Epistemic Situation Calculus Theories},
author = {De Giacomo, Giuseppe and Lespérance, Yves and Patrizi, Fabio},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {846--852},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/131},
}
TY - CPAPER TI - Bounded Epistemic Situation Calculus Theories AU - De Giacomo, Giuseppe AU - Lespérance, Yves AU - Patrizi, Fabio T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 846 EP - 852 UR - https://ijcai.org/proceedings/2013/131 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
