As new unanticipated items are added to a memory, it must be able to reorganize itself, integrating the new items into its structure. The reorganization process must maintain the memory's structure and also build up the knowledge retrieval strategies need to search that structure. This study will present an algorithm for knowledge‐based memory reorganization. Included in that algorithm are processes for directed generalization and generalization refinement. A fact retrieval system called CYRUS which uses the algorithm is also presented. Conclusions are (...) drawn about maintaining accessibility in a conceptual memory, organizing generalized knowledge with respect to specific knowledge, and expected retrieval failures due to change over time in the memory's organization. (shrink)

Adaptive Planning is an approach to planning in the commonsense domain. An adaptive planner takes advantage of the habitual nature of many of the planning situations for which it plans by bosing its activities on a memory of pre‐stored plans. A critical issue, and the subject of this paper, is the question of flexibility: How does an adaptive planner refit an old plan in order to meet the demands of some new planning situation? An adaptive planner refits prestored plans by (...) constructing an interpretation of the situation in which it is engaged. Key elements in the theory of adaptive planning are its treatment of specific plans and a notion of situation matching. The theory of adaptive planning has been modeled by a computer program called PLEXUS. (shrink)