Efficient case retrieval
The similarity metric considers the foot-printed initial state and the goal interactions of the past cases.
Hash tables prune the set of candidate analogs as early as possible.
The matching is done incrementally until a “reasonable” similar set of past cases is found according to a previously set threshold for the partial match.
KeywordsGoal Statement Problem Solver Hash Table Search Cost Partial Match
Unable to display preview. Download preview PDF.