Monthly
288 pp. per issue
6 x 9, illustrated
ISSN
0899-7667
E-ISSN
1530-888X
2014 Impact factor:
2.21

Neural Computation

Winter 1989, Vol. 1, No. 4, Pages 559-567
(doi: 10.1162/neco.1989.1.4.559)
© 1989 Massachusetts Institute of Technology
Unification as Constraint Satisfaction in Structured Connectionist Networks
Article PDF (378.79 KB)
Abstract

Unification is a basic concept in several traditional symbolic formalisms that should be well suited for a connectionist implementation due to the intuitive nature of the notions it formalizes. It is shown that by approaching unification from a graph matching and constraint satisfaction perspective a natural and efficient realization in a structured connectionist network can be found.