A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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.doi:10.1162/neco.1922.214.171.1249 fatcat:veqo5mtg75aqdfa7ysr2jma7g4