Unification as Constraint Satisfaction in Structured Connectionist Networks

Andreas Stolcke
1989 Neural Computation  
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.1989.1.4.559 fatcat:veqo5mtg75aqdfa7ysr2jma7g4