Proof systems for planning under 0-approximation semantics

In this paper we propose Hoare style proof systems called PR D 0 and PRKW D 0 for plan generation and plan verification under 0-approximation semantics of the action language A K . In PR D 0 (resp. PRKW D 0 ), a Hoare triple of the form { X } c { Y } (resp. { X } c {KW p }) means that all literals in Y become true (resp. p becomes known) after executing plan c in a state satisfying all literals in X . The proof systems are shown to be sound and complete, and more importantly, they give a way to efficiently generate and verify longer plans from existing verified shorter plans by applying so-called composition rule, provided that an enough number of shorter plans have been properly stored. The idea behind is a tradeoff between space and time, we refer it to off-line planning and point out that it could be applied to general planning problems.