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.

This content is only available as a PDF.
© 1989 Massachusetts Institute of Technology
1989
You do not currently have access to this content.