Generating Conjunctive Refinement Planners
0*. If «P » is empty, Fail.
1. If a minimal candidate of P
is a solution, terminate.
2. Select a refinement strategy R .
Appply R to P to get a set of new plans P1…Pj
Add all plans to the search queue.
4. Non-deterministically select one of the plans P i
Keep all linearizations safe
(Tractability refinements)
Select the proof strategy so it becomes
incremental with respect to the refinement
Stick to a single refinement strategy