(Enter summary)
Abstract: This paper presents a connectionist unification strategy for a Prolog-system. The unification
strategy utilizes a backprop-net (bp-net) and a distributed connectionist representation. The most-generalunifier
is computed by the connectionist heuristic in constant time. To keep the system also efficient in space the
distributed representation was choosen. It is possible to show that this representation is assoziative. Moreover
this connectionist strategy allows to use semantics and context during ... (Update)
Context of citations to this paper: More
...Prolog) was built. It is part of the system CUP [19] containing several symbolic algorithms and a distributed strategy (d CUP [18]) The theoremprover itself is a symbolic system. If the system needs to calculate a mgu the currently selected unification strategy is invoked....
.... based on localist representations are presented in [Sto89, Kur91, Hoe90] Distributed representations have been used in [Web92, SW92]. However, in most cases these neural network implementations of the parameter matching function have been used in fully integrated...
Cited by: More
Functional Compositionality and a new view of Knowledge.. - Hammerton (1997)
(Correct)
Connectionist Variable Binding - Browne, Sun (2000)
(Correct)
Holistic Computation: Reconstructing a muddled concept - Hammerton (1998)
(Correct)
Similar documents (at the sentence level):
27.2%: Connectionist Unifying Prolog - Weber
(Correct)
Active bibliography (related documents): More All
2.0: Unification in Prolog by Connectionist Models - Weber (1993)
(Correct)
0.8: Potentiality of Parallelism in Logic - Kurfeß (1991)
(Correct)
0.6: New Bounds in Parallel Unification - Bellia, Occhiuto (2001)
(Correct)
Similar documents based on text: More All
0.0: A High Speed Prolog Implementation on a VLIW Processor - Schenk (1989)
(Correct)
0.0: A Refined Version of General E-Unification - Socher-Ambrosius
(Correct)
0.0: Approaches to the Formal Verification of Hybrid Systems - Kowalewski, Herrmann.. (2000)
(Correct)
Related documents from co-citation: More All
4: Parallel logic inference and energy minimization (context) - Ballard - 1986
3: Recursive distributed representations
- Pollack - 1990
3: Tensor product variable binding and the representation of symbolic structures in.. (context) - Smolensky - 1990
BibTeX entry: (Update)
V. Weber. Connectionist unification with a distributed representation. In International Joint Conference on Neural Networks, IJCNN'92, volume III, pages 555--560, Beijing, China, November 1992. INNS, CNNC, and IEEE NNC. http://citeseer.ist.psu.edu/weber92connectionist.html More
@inproceedings{ weber92connectionist,
author = "Weber, V.",
title = "Connectionist Unification with a distributed representation",
booktitle = "Proceedings of the International Joint Conference on Neural Networks -- {IJCNN} '92, Beijing, China",
publisher = "IEEE",
address = "Piscataway, NJ",
pages = "555--560",
year = "1992",
url = "citeseer.ist.psu.edu/weber92connectionist.html" }
Citations (may not include all citations):
788
Rewrite systems
- Dershowitz, Jouannaud - 1990
634
A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
261
An introduction to Prolog III (context) - Colmerauer - 1990
134
Unification theory
- Siekmann - 1989
99
Tensor product variable binding and the representation of sy.. (context) - Smolensky - 1990
87
An efficient unification algorithm (context) - Martelli, Montanari
68
Unification: A Multidisciplinary Survey (context) - Knight - 1989
51
Linear unification (context) - Paterson, Wegman - 1976
51
the sequential nature of unification (context) - Dwork, Kanellakis et al. - 1984
40
Holographic reduced representations
- Plate - 1991
30
The sharing of structure in theorem-proving programs (context) - Boyer, Moore - 1972
24
The semantics of grammar formalisms seen as computer languag..
- Pereira, Shieber - 1984
22
Computational logic: The unification computation (context) - Robinson - 1971
19
A connectionist approach to knowledge representation and lim.. (context) - Shastri - 1988
17
the parallel computational complexity of unification (context) - Yasuura - 1983
15
Deduction systems based on resolution
- Eisinger, Ohlbach
13
A User's Guide to PlaNet Version (context) - Miyata - 1991
8
Parallel logic inference and energy minimization (context) - Ballard - 1986
6
A lexical functional grammar system in prolog
- Eisele, Dorre - 1986
6
Unification as constraint satisfaction in structured connect..
- Stolcke - 1989
4
Complexity of the unification algorithm for first-order expr.. (context) - Venturini-Zilli - 1975
4
Generierung naturlichsprachlicher Satze in unifikationsbasie.. (context) - Stolcke - 1988
4
On parallel unification for Prolog (context) - Harland, Jaffar - 1987
4
The SUM: An AI coprocessor (context) - Robinson - 1985
3
Assoziative Prozessoren und ihre Anwendung fur das Theorembe.. (context) - Muller - 1983
3
An approach to parallel unification using transputers (context) - Hager, Moser - 1989
3
Unifikation in Prolog mit konnektionistischen Modellen (context) - Weber - 1992
3
Resolution d'equations dans les langages d'odre (context) - Huet - 1976
2
Parallel algorithms for unification and other complete probl.. (context) - Vitter, Simons - 1984
2
Recherches sour la th'eorie de la d'emonstration (context) - Herbrand - 1930
2
A Connectionist Unification Algorithm (context) - Holldobler - 1990
1
Recursive distributed representstions (context) - Pollack - 1990
1
back propagation algorithm (context) - Stornetta, Huberman et al. - 1987
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC