Selectively Generalizing Plans for Problem-Solving

@inproceedings{Minton1985SelectivelyGP,
  title={Selectively Generalizing Plans for Problem-Solving},
  author={Steven Minton},
  booktitle={IJCAI},
  year={1985}
}
Abst ract Problem solving programs that generalize and save plans in order to improve their subsequent performance inevitably face the danger of being overwhelmed by an ever-increasing number of stored plans. To cope with this problem, methods must be developed for selectively learning only the most valuable aspects of a new plan. This paper describes MORRIS, a heuristic problem solver that measures the utility of plan fragments to determine whether they are worth learning. MORRIS generalizes… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
115 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Learning by Experimentation: Acquiring and Refining Problem-Solving Heuristics

  • T. Mitchell, P. Utgoff, R. Banerjl
  • In Machine Learning,
  • 1983
1 Excerpt

GPS: A Case Study in Generality and Problem Solving

  • G. Ernst, Newell
  • 1969
1 Excerpt

Similar Papers

Loading similar papers…