Brian P. Kettler, James A. Hendler and William A. Andersen
Unlike traditional CBP systems, the CAPER case-based planner1 uses massively parallel retrieval methods to retrieve cases very quickly from an unindexed casebase. This casebase is implemented using the PARKA parallel, frame-based knowledge representation system2. When run on the 16K processor Connection Machine, these parallel procedures yield plan retrieval times on the order of tenths of a second for a casebase of 100 cases containing 1200 transport logistics plans (and subplans). Furthermore, while case retrieval times for serial procedures typically grow worse than linearly in the size of the casebase, CaPER’s parallel procedures have exhibited retrieval times growing only logarithmically in the size of the casebase. Thus CAPER can support efficient retrieval from casebases in the thousands of cases.