Bounded Epistemic Situation Calculus Theories
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.
Cite
Text
De Giacomo et al. "Bounded Epistemic Situation Calculus Theories." International Joint Conference on Artificial Intelligence, 2013.Markdown
[De Giacomo et al. "Bounded Epistemic Situation Calculus Theories." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/giacomo2013ijcai-bounded/)BibTeX
@inproceedings{giacomo2013ijcai-bounded,
title = {{Bounded Epistemic Situation Calculus Theories}},
author = {De Giacomo, Giuseppe and Lespérance, Yves and Patrizi, Fabio},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {846-853},
url = {https://mlanthology.org/ijcai/2013/giacomo2013ijcai-bounded/}
}