Case storage: Automated indexing

Part of the Lecture Notes in Computer Science book series (LNCS, volume 886)


This chapter presented the indexing of the cases, the data structures supporting the organization of the case library, and the complete storage algorithm.

The storage algorithm involves the identification of the set of indices for a case and the selection of appropriate data structures to organize the acquired knowledge in the case library.

The interacting goals are identified by partially ordering the totally ordered solution found. The connected components of the partially ordered plan determine the independent fragments of the case each corresponding to a set of interacting goals. Each case is multiply indexed by the sets of interacting goals. The relevant literals of the initial state are foot-printed for each goal conjunct in the goal statement by goal regressing through the episodic plan found.


Goal Statement Hash Table Plan Step Case Library Weak Precondition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Personalised recommendations