Some Results on the Completeness of Approximation Based Reasoning.
Tran Cao Son, Enrico Pontelli, Son Thanh To · 2008
We present two results that relate the completeness condi-tions for the 0-approximation for two formalisms: the action description language A and the situation calculus. The first result indicates that the completeness condition for the situa-tion calculus formalism implies the corresponding condition for the action language formalism. The second result indi-cates that an action theory in A can sometimes be simplified to an equivalent action theory whose completeness condition is weaker than the original theory for certain queries.