(De)Composition of Situation Calculus Theories

Abstract

We show that designing large situation calculus theories can be simplified by using object-oriented techniques and tools together with established solutions to the frame problem. Situation calculus (McCarthy & Hayes 1969) is one of the leading logical representations for action and change, but large situation calculus theories are not easy to design and maintain, nor are they flexible for extension or reuse. However, we wish to use it to represent large, complex domains. To address this problem, we apply our proposed methodology to situation calculus theories and analyze the composition of theories in this light. The object-oriented tools that we use do not change the semantics of situation calculus, so all the original situation calculus results apply in our setting and vice versa. We get two additional results from this approach. First, we offer a new treatment of loosely interacting agents that uses situation calculus without abandoning the result formalism. This treatment allows a theory-builder to construct a theory without considering its potential inclusion in a multiple-agents setup. Second, theories that we build in this way admit specialized reasoning algorithms.

Cite

Text

Amir. "(De)Composition of Situation Calculus Theories." AAAI Conference on Artificial Intelligence, 2000.

Markdown

[Amir. "(De)Composition of Situation Calculus Theories." AAAI Conference on Artificial Intelligence, 2000.](https://mlanthology.org/aaai/2000/amir2000aaai-de/)

BibTeX

@inproceedings{amir2000aaai-de,
  title     = {{(De)Composition of Situation Calculus Theories}},
  author    = {Amir, Eyal},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2000},
  pages     = {456-463},
  url       = {https://mlanthology.org/aaai/2000/amir2000aaai-de/}
}