Precondition control and the Progression algorithm
Alfredo Gabaldon · 2004
We consider the problem of planning with declarative search control in the framework of the situation cal-culus. In particular, we are concerned with forward-chaining planning with search control expressed by lin-ear temporal logic formulas in the style of Bacchus & Kabanza’s TLPlan system. We introduce a procedure for extracting conditions which can then be evaluated on plan prefixes for enforcing search control. These condi-tions are situation calculus formulas whose entailment can be checked by regression and can be used as further preconditions of actions in nonMarkovian action theo-ries and in some cases in classical Markovian theories through a transformation procedure. We show that these conditions eliminate exactly the same plan prefixes as the Progression algorithm of the TLPlan system.