Connectionist Unifying Prolog (1993)
| Venue: | In |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Weber93connectionistunifying,
author = {Volker Weber},
title = {Connectionist Unifying Prolog},
booktitle = {In},
year = {1993},
pages = {213--20},
publisher = {Springer-Verlag}
}
OpenURL
Abstract
We introduce an connectionist approach to unification using a local and a distributed representation. A Prolog-System using these unification-strategies has been build. Prolog is a Logic Programming Language which utilizes unification. We introduce a uncertainty measurement in unification. This measurement is based on the structure-abilities of the chosen representations. The strategy using a local representation, called `-CUP, utilizes a self-organizing feature-map (FM-net) to determine similarities between terms and induces the representation for a relaxation-network (relax-net). The strategy using a distributed representation, called d-CUP, embeds a similarity measurement by its recurrent representation. It has the advantage that similar terms have a similar representation. The unification itself is done by a backpropagation network (BP-net). We have proven the systems adequacy for unification, its efficient computation, and the ability to do extended unification. 1 Introduction Un...







