Ways of using the Domain Knowledge
As search control
- HTN schemas, TLPlan rules, SHOP procedures
- Issues of Efficient Matching
To prune unpromising partial solutions
- HTN schemas, TLPlan rules, SHOP procedures
- Issues of maintaining multiple parses
As declartative axioms that are used along with other knowledge
- SATPlan+Domain specific knowledge
- Cutting Planes (for ILP encodings)
- Issues of domain-knowledge driven simplification
Folded into the domain-independent algorithm to generate a new domain-customized planner
- CLAY
- Issues of Program synthesis