Some Results on the Completeness of Approximation Based Reasoning

Architectures for Intelligent Theory-Based Agents

Volume

Papers from the 2008 AAAI Spring Symposium

Contents

We present two results that relate the completeness conditions for the 0-approximation for two formalisms: the action description language $cala$ and the situation calculus. The first result indicates that the completeness condition for the situation calculus formalism implies the corresponding condition for the action language formalism. The second result indicates that an action theory in $cala$ can sometimes be simplified to an equivalent action theory whose completeness condition is weaker than the original theory for certain queries.