Phillips, S. and Halford, G. S. and Wilson, W. H. (1995) The processing of associations versus the processing of relations and symbols: A systematic comparison. [Conference Paper]
Full text available as:
Postscript
94Kb |
Abstract
A mathematical basis is proposed for the distinction between associative and relational (symbolic) processing. Associations can be contrasted with relations in terms of ordered pairs versus general ordered N-tuples, and unidirectional access versus omnidirectional access. Relations also have additional properties: they can exhibit predicate-argument bindings, they can be arguments to higher-order structures, and they can participate in operations of selection, projection, join, union, intersection, and difference. Relations can be used to represent structures such as lists, trees and graphs, and relational instances can be thought of as propositions. Within neural net architectures, feedforward networks can be identified with associative proceessing, and tensor product networks with relational processing. Relations have the essential properties of symbolic processing; flexibility, accessibility, and utility for repesenting complex data structures.
Item Type: | Conference Paper |
---|---|
Keywords: | relations, associations, omnidirectional, unidirectional, arity, feedforward networks, tensor networks, balance scale |
Subjects: | Psychology > Cognitive Psychology Computer Science > Neural Nets |
ID Code: | 764 |
Deposited By: | Phillips, Steven |
Deposited On: | 09 Dec 1998 |
Last Modified: | 11 Mar 2011 08:54 |
Metadata
- ASCII Citation
- Atom
- BibTeX
- Dublin Core
- EP3 XML
- EPrints Application Profile (experimental)
- EndNote
- HTML Citation
- ID Plus Text Citation
- JSON
- METS
- MODS
- MPEG-21 DIDL
- OpenURL ContextObject
- OpenURL ContextObject in Span
- RDF+N-Triples
- RDF+N3
- RDF+XML
- Refer
- Reference Manager
- Search Data Dump
- Simple Metadata
- YAML
Repository Staff Only: item control page