Relating Logic Programming Theories of Actions and Partial Order Planning

Contents

In this paper we argue that logic programming theories of action allow us to identify subclasses when the corresponding logic program has nice properties (such as acyclicity) that guarantees decidability and sometimes polynomial time plan testing. As an example we extend the action description language .A to allow executability conditions and show its formalization in logic programming. We show the relationship between the execution of partial order planners and the SLDNF tree with respect to the corresponding logic programs. In the end we briefly discuss how this relationship helps us in extending partial order planners to extended languages by following the corresponding logic program.