The Refinement Planning Template

Refineplan( P : Plan set)

0*. If «P » is empty, Fail.

1. If a minimal candidate of P is a solution, return it. End

2. Select a refinement strategy R

Apply R to P to get a new plan set P’

3. Call Refine(P’ )

-- Termination ensured if R is complete and monotonic

-- Solution check done using one of the proofs of correctness

Issues:

1. Representation of plan sets (Conjunctive vs. Disjunctive)

2. Search vs. solution extraction

3. Affinity between refinement and proof used for solution check