On the sequential nature of unification
Journal of Logic Programming
Complete sets of unifiers and matchers in equational theories
Theoretical Computer Science
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
Connectionism and cognitive architecture: a critical analysis
Connections and symbols
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm
Proceedings of the 7th International Conference on Automated Deduction
An ideal model for recursive polymorphic types
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallel Unification Scheduling in Prolog
Parallel Unification Scheduling in Prolog
Unification as constraint satisfaction in structured connectionist networks
Neural Computation
Optimization in model matching and perceptual organization
Neural Computation
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
| Hi-index | 0.00 |
A connectionist unification algorithm is presented. It utilizes the fact that the most general unifier of two terms corresponds to a finest valid equivalence relation defined on a occurrence-label representation of the unification problem. The algorithm exploits the maximal parallelism inherent in the computation of such a finest valid equivalence relation while using only computational features of connectionism. It can easily be restricted to solve special forms of the unification problem such as the word problem, the matching problem, or the unification problem over infinite trees.