OVERCOMING RULE-BASED RIGIDITY AND CONNECTIONIST LIMITATIONS THROUGH MASSIVELY-PARALLEL CASE-BASED REASONING

Symbol manipulation as used in traditional Artificial Intelligence has been criticized by neural net researchers for being excessively inflexible and sequential. On the other hand, the application of neural net techniques to the types of high-level cognitive processing studied in traditional artificial intelligence presents major problems as well. We claim that a promising way out of this impasse is to build neural net models that accomplish massively parallel case-based reasoning. Case-based reasoning, which has received much attention recently, is essentially the same as analogy-based reasoning, and avoids many of the problems leveled at traditional artificial intelligence. Further problems are avoided by doing many strands of case-based reasoning in parallel, and by implementing the whole system as a neural net. In addition, such a system provides an approach to some aspects of the problems of noise, uncertainty and novelty in reasoning systems. We are accordingly modifying our current neural net system (Conposit), which performs standard rule-based reasoning, into a massively parallel case-based reasoning version. © 1992.