Some Results on the Completeness of Approximation Based Reasoning

Tran Son, Enrico Pontelli, To Thanh Son

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.

Subjects: 11. Knowledge Representation.

Submitted: Jan 19, 2008


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.