PRODIGY: STATIC

Description

• Derives control rules from analysis of domain descriptions
• Domain viewed as expanded AND/OR graph
  • Nodes of graph are literals
  • Edges are uninstantiated operators
  • Each literal considered separately
  • Backchains on operators that unify with the literal until failure, goal interaction, or recursion encountered
• Corresponds to FAILS and GOAL-INTERACTION concepts in explanation-based learning
• Serves as partial evaluator of domain description