RELATING LOGIC PROGRAMMING THEORIES OF ACTIONS AND PARTIAL ORDER PLANNING

In this gaper we argue that logic programming theories of action allow us to identify subclasses for which the corresponding logic program h as nice properties (such as acyclicity). As an example we extend the a ction description language A to allow executability conditions and sho w its formalization in logic programming. We show the relationship bet ween the execution of partial order planners and the SLDNF tree with r espect to the corresponding logic programs. In the end we briefly disc uss how this relationship helps us in extending partial order planners to extended languages by following the corresponding logic program.