Symbols among the neurons: details of a connectionist inference architecture

  • Authors:
  • David S. Touretzky;Geoffrey E. Minton

  • Affiliations:
  • Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pennsylvania;Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pennsylvania

  • Venue:
  • IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pattern matching and variable binding are easily implemented in conventional computer architectures, but not necessarily in all architectures. In a distributed neural network architecture each symbol is represented by activity in many units and each unit contributes to the representation of many symbols. Manipulating symbols using this type of distributed representation is not as easy as with a local representation whore each unit denotes one symbol, but there is evidence that the distributed approach is the one chosen by nature. We describe a working implementation of a production system interpreter in a neural network using distributed representations for both symbols and rules. The research provides a detailed account of two important symbolic reasoning operations, pattern matching and variable binding, as emergent properties of collections of neuron-like elements. The success of our production system implementation goes some way towards answering a common criticism of connectionist theories: that they aren't powerful enough to do symbolic reasoning.