Some results on the completeness of approximation based reasoning

Abstract

We present two results relating the completeness condition of the 0-approximation for two formalisms: the action description language and the situation calculus. The first result suggests that the condition for the situation calculus formalism implies the condition for the action language formalism. The second result indicates that an action theory in can sometimes be simplified to an equivalent action theory whose completeness condition is weaker than the original theory for certain queries. © 2008 Springer Berlin Heidelberg.