Unification as constraint satisfaction in structured connectionist networks

Authors:
Andreas Stolcke
Affiliations:
Computer Science Division, University of California, Berkeley, CA 94720 USA, and International Computer Science Institute, 1947 Center Street, Suite 600, Berkeley, CA 94704 USA
Venue:
Neural Computation
Year:
1989

Citing 3
Cited 2

On the sequential nature of unification

Journal of Logic Programming
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimization in model matching and perceptual organization

Neural Computation

A structured connectionist unification algorithm

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
A dynamic binding mechanism for retrieving and unifying complex predicate-logic knowledge

ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.