The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A Distributed Connectionist Production System
Abstract
DCPS is a connectionist production system interpreter that uses distributed representations. As a connectionist model it consists of many simple, richly interconnected neuron‐like computing units that cooperate to solve problems in parallel. One motivation for constructing DCPS was to demonstrate that connectionist models are capable of representing and using explicit rules. A second motivation was to show how “coarse coding” or “distributed representations” can be used to construct a working memory that requires far fewer units than the number of different facts that can potentially be stored. The simulation we present is intended as a detailed demonstration of the feasibility of certain ideas and should not be viewed as a full implementation of production systems. Our current model only has a few of the many interesting emergent properties that we eventually hope to demonstrate: It is damage‐resistant, it performs matching and variable binding by massively parallel constraint satisfaction, and the capacity of its working memory is dependent on the similarity of the items being stored.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Self-citationRumelhart, D. E., & McClelland, J. L. (1986) · The MIT Press eBooks · Cited by 2,908
Molecular Biology of Learning: Modulation of Transmitter Release
Kandel, E. R., & Schwartz, J. H. (1982) · Science · doi:10.1126/science.6289442 · Cited by 1,551
Connectionist models and their properties
FELDMAN, J., & BALLARD, D. (1982) · Cognitive Science · doi:10.1016/s0364-0213(82)80001-3 · Cited by 1,474
Parallel models of associative memory
Heath, R. (1982) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(82)90036-0 · Cited by 1,095
Hinton, G. E. (2018) · KiltHub Repository · doi:10.1184/r1/6604925 · Cited by 1,025
Self-citationParallel models of associative memory
Hinton, G. E., & Anderson, J. A. (1981) · CERN Document Server (European Organization for Nuclear Research) · Cited by 927
Self-citationLearning distributed representations of concepts.
Hinton, G. E. (1989) · eScholarship (California Digital Library) · Cited by 827
Self-citationPerception and Production of Fluent Speech
Cole, R. A. (2016) · Routledge eBooks · doi:10.4324/9781315638935 · Cited by 775
Rolls, E. T. (1984) · PubMed · Cited by 366
A parallel computation that assigns canonical object-based frames of reference
Hinton, G. E. (1981) · International Joint Conference on Artificial Intelligence · Cited by 188
Self-citationShape representation in parallel systems
Hinton, G. E. (1981) · International Joint Conference on Artificial Intelligence · Cited by 119
Self-citationAckley, D. H., Hinton, G. E., & B, T. J. S. A. (1987) · Elsevier eBooks · doi:10.1016/b978-0-08-051581-6.50053-2 · Cited by 107
Self-citationNeural Representation of Conceptual Knowledge.
Feldman, J. A. (1986) · Defense Technical Information Center (DTIC) · Cited by 103
Harpy, production systems and human cognition
Newell, A. (2018) · KiltHub Repository · doi:10.1184/r1/6606053 · Cited by 92
Parallel logical inference and energy minimization
Ballard, D. H. (1986) · Cited by 27
Is Distributed Connectionism Compatible with the Physical Symbol System Hypothesis
Derthick, M., & Plaut, D. C. (1986) · eScholarship (California Digital Library) · Cited by 20
Cited by
A theory of lexical access in speech production
Levelt, W. J. M., Roelofs, A., & Meyer, A. S. (1999) · Behavioral and Brain Sciences · doi:10.1017/s0140525x99001776 · Cited by 5,136
Neural-network-based fuzzy logic control and decision system
Lin, C.-T., & Lee, C. S. G. (1991) · IEEE Transactions on Computers · doi:10.1109/12.106218 · Cited by 1,480
Foundations of neural networks, fuzzy systems, and knowledge engineering
(1997) · Choice Reviews Online · doi:10.5860/choice.35-0330 · Cited by 821
Holographic reduced representations
Plate, T. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.377968 · Cited by 657
“Touretzky and Hinton [35] and Rosenfield and Touretzky [28] discussed binary-OR memories? which can be viewed as a nonlinear version of an addition memories.”
BackgroundMethodInfluentialShastri, L., & Ajjanagadde, V. (1993) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00030910 · Cited by 634
Metadata
- Authors
- Touretzky, D. S., & Hinton, G. E.
- Venue
- Cognitive Science
- Publisher
- Wiley
- Published
- 1988-07
- Volume
- 12
- Issue
- 3
- Pages
- 423-466
- ISSN
- 0364-0213 (ISSN-L)
- 1551-6709
- OpenAlex
- W2165957955
- Cited by
- 285
- References
- 21
- FWCI
- 32.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.