Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1994). Case storage: Automated indexing. In: Veloso, M.M. (eds) Planning and Learning by Analogical Reasoning. Lecture Notes in Computer Science, vol 886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58811-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-58811-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58811-5
Online ISBN: 978-3-540-49109-5
eBook Packages: Springer Book Archive