A structured connectionist model using temporal synchrony has been proposed by Shastri & Ajjanagadde. This model has provided a mechanism which encodes rules and facts involving n-ary predicates and handles some types of dynamic variable binding. Their model, however, has problems in dealing with important knowledge representation issues such as binding generation, consistency checking, unification, etc. This paper presents a restructuring of the original model which overcomes many of its limitations while, at the same time, reducing the number of types of node required and maintaining the merits of the original model.
|Publication status||Published - 1993|