Abstract
At the intersection between symbolic inference and connectionism, there is interest in producing systems constructed from connectionist components which perform types of inference comparable to symbolic systems. The attraction of such systems is that, under restricted conditions, they may be capable of very fast, "reactive" responses to external stimuli. A major open question in this field is the extent to which a connectionist architecture can accommodate basic concepts of symbolic inference, such as unification of terms. One of the current leaders in this area is the rule-based system proposed by Shastri & Ajjanagadde (1993). We demonstrate that the mechanism for variable binding which they advocate is fundamentally limited and show howe a reinterpretation of the primitive compontents of their system can extend the range of inference which can be supported.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of ILP Workshop on Logic and Reasoning with Neural Networks |
| Publication status | Published - 1 Jun 1994 |