Symbol grounding using neural networks

The classical approach to artificial intelligence (i.e. symbol manipulation) and the connectionist approach (artificial neural networks) have been criticized for their inadequacies. The philosopher John Searle's Chinese room thought experiment argued that symbolic systems have no understanding of the meaning contained in their representations. The philosophers Jerry Fodor and Zenon Pylyshyn argued that artificial neural networks could not exhibit certain features of human cognition, such as systematicity and composition of representations. We take the view that both of these problems can be solved by a suitable integration of connectionist and symbolic systems. In this work we investigate methods of using artificial neural networks to produce descriptions in propositional and predicate logic. Artificial neural networks are stuctured such that, upon training, simple features of the network correspond directly to either propositional variables in one case, and objects and predicates in the other. In both cases, the methods were tested on character recognition tasks.

[1]  John Dinsmore,et al.  The symbolic and connectionist paradigms : closing the gap , 1992 .

[2]  Cynthia Macdonald,et al.  Connectionism: Debates on Psychological Explanation , 1995 .

[3]  S. Stich,et al.  Connectionism, Eliminativism, and the Future of Folk Psychology , 1990 .

[4]  Frédéric Alexandre,et al.  Connectionist-Symbolic Integration: From Unified to Hybrid Approaches , 1996 .

[5]  Ron Sun,et al.  An efficient feature-based connectionist inheritance scheme , 1993, IEEE Trans. Syst. Man Cybern..

[6]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[7]  Michael C. Mozer,et al.  The Connectionist Scientist Game: Rule Extraction and Refinement in a Neural Network , 1991 .

[8]  L. Steels The symbol grounding problem has been solved, so what’s next? , 2008 .

[9]  D. McDermott LANGUAGE OF THOUGHT , 2012 .

[10]  Jordan B. Pollack,et al.  Recursive Distributed Representations , 1990, Artif. Intell..

[11]  Christoph Goller,et al.  Learning task-dependent distributed representations by backpropagation through structure , 1996, Proceedings of International Conference on Neural Networks (ICNN'96).

[12]  Stevan Harnad The Symbol Grounding Problem , 1999, ArXiv.

[13]  Mariarosaria Taddeo,et al.  Solving the symbol grounding problem: a critical review of fifteen years of research , 2005, J. Exp. Theor. Artif. Intell..

[14]  P. Smolensky THE CONSTITUENT STRUCTURE OF CONNECTIONIST MENTAL STATES: A REPLY TO FODOR AND PYLYSHYN , 2010 .

[16]  Joachim Diederich,et al.  Survey and critique of techniques for extracting rules from trained artificial neural networks , 1995, Knowl. Based Syst..

[17]  Ron Sun,et al.  On Variable Binding in Connectionist Networks , 1992 .

[18]  Tony A. Plate,et al.  Holographic reduced representations , 1995, IEEE Trans. Neural Networks.

[19]  Geoffrey E. Hinton,et al.  Symbols Among the Neurons: Details of a Connectionist Inference Architecture , 1985, IJCAI.

[20]  R. M. Siegel,et al.  Bright Air, Brilliant Fire: On the Matter of the Mind , 1992 .

[21]  C. Goller,et al.  A Connectionist Control Component for the Theorem Prover SETHEO , 1994 .

[22]  Jude Shavlik,et al.  THE EXTRACTION OF REFINED RULES FROM KNOWLEDGE BASED NEURAL NETWORKS , 1993 .

[23]  Geoffrey E. Hinton Tensor Product Variable Binding and the Representation of Symbolic Structures in Connectionist Systems , 1991 .

[24]  M. Thonnat,et al.  Symbol Grounding for Semantic Image Interpretation: From Image Data to Semantics , 2005, Tenth IEEE International Conference on Computer Vision Workshops (ICCVW'05).

[25]  Pascal Hitzler,et al.  Logic programs and connectionist networks , 2004, J. Appl. Log..

[26]  Rose Holley How Good Can It Get? Analysing and Improving OCR Accuracy in Large Scale Historic Newspaper Digitisation Programs , 2009, D Lib Mag..

[27]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[28]  Christoph Goller,et al.  A connectionist approach for learning search-control heuristics for automated deduction systems , 1999, DISKI.

[29]  Herbert A. Simon,et al.  Computer Science as Empirical Inquiry , 2011 .

[30]  Stevan Harnad,et al.  The Turing Test is not a trick: Turing indistinguishability is a scientific criterion , 1992, SGAR.

[31]  Geoffrey E. Hinton BoltzCONS: Dynamic Symbol Structures in a Connectionist Network , 1991 .

[32]  John R. Searle,et al.  Minds, brains, and programs , 1980, Behavioral and Brain Sciences.

[33]  J. Fodor,et al.  Connectionism and cognitive architecture: A critical analysis , 1988, Cognition.