Solution Extraction in Disjunctive Plans
Verify if some minimal candidate of the disjunctive plan is a solution (“Model Finding” )
- Involves (implicit or explicit) use of proof strategies
Direct methods: Can be solved using special techniques customized to the disjunctive structure
- Graphplan backward search; Graphplan local search
Compilation methods: Generate a set of constraints, whose satisfaction ensures that a substructure of the disjunctive structure is a solution. Find a model for the constraints.
- Constraints will correspond to lines of proof
- Progression proof, regression proof, causal proof
- Constraints can be in any standard form