AAAI Publications, Workshops at the Twenty-Sixth AAAI Conference on Artificial Intelligence

Font Size: 
Bounded Situation Calculus Action Theories and Decidable Verification
Giuseppe De Giacomo, Yves Lesperance, Fabio Patrizi

Last modified: 2012-07-15


We define a notion of bounded action theory in the situation calculus, where the theory entails that in all situations, the number of ground fluent atoms is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We argue that such theories are fairly common in applications, either because facts do not persist indefinitely or because one eventually forgets some facts, as one learns new ones. We discuss various ways of obtaining bounded action theories. The main result of the paper is that verification of an expressive class of first-order $\mu$-calculus temporal properties in such theories is in fact decidable. This paper is an abridged version of a paper appeared in KR'12.


Cognitive Robotics, Situation Calculus, Verification, Decidability

Full Text: PDF