Minds and Machines 3 (1):53-71 (1993)
AbstractA rule-based expert system is demonstrated to have both a symbolic computational network representation and a sub-symbolic connectionist representation. These alternate views enhance the usefulness of the original system by facilitating introduction of connectionist learning methods into the symbolic domain. The connectionist representation learns and stores metaknowledge in highly connected subnetworks and domain knowledge in a sparsely connected expert network superstructure. The total connectivity of the neural network representation approximates that of real neural systems and hence avoids scaling and memory stability problems associated with other connectionist models.
Similar books and articles
Experts in Uncertainty: Opinion and Subjective Probability in Science.Roger M. Cooke (ed.) - 1991 - Oxford, England: Oxford University Press.
PDP Networks Can Provide Models That Are Not Mere Implementations of Classical Theories.Michael R. W. Dawson, David A. Medler & Istvan S. N. Berkeley - 1997 - Philosophical Psychology 10 (1):25-40.
On the Compatibility of Connectionist and Classical Models.John Hawthorne - 1989 - Philosophical Psychology 2 (1):5-16.
Connectionist Computation.Gualtiero Piccinini - 2007 - In Proceedings of the 2007 International Joint Conference on Neural Networks.
Representational Trajectories in Connectionist Learning.Andy Clark - 1994 - Minds and Machines 4 (3):317-32.
Model for Knowledge and Legal Expert Systems.Anja Oskamp - 1992 - Artificial Intelligence and Law 1 (4):245-274.
Added to PP
Historical graph of downloads
Citations of this work
No citations found.
References found in this work
Could a Machine Think?Paul M. Churchland & Patricia S. Churchland - 1990 - Scientific American 262 (1):32-37.