Other Direct Extraction Strategies
Motivation: No compelling reason for making the search for a valid subgraph backward, or systematic...
Alternatives:
- Forward Search (dynamic programming) [Parker & Kambhampati; 98,99; Blum & Langford 98]
- Systematic Undirectional search [Rintanen, 98]
- Select an action anywhere in the plan-graph for inclusion in the solution; Propagate consequences (adapts normal CSP Search to plan-graph)
- Local Search [Gerevini et. al., 99]