Massively Parallel Simulation of Structured Connectionist Networks: An Interim Report

We map structured connectionist models of knowledge representation and reasoning onto existing general purpose massively parallel architectures with the objective of developing and implementing practical, realtime knowledge base systems. Shruti, a connectionist knowledge representation and reasoning system which attempts to model reflexive reasoning, will serve as our representative connectionist model. Efficient simulation systems for shruti are developed on the Connection Machine CM-2 an SIMD architecture and on the Connection Machine CM-5 an MIMD architecture. The resulting simulators are evaluated and tested using large, random knowledge bases with up to half a million rules and facts. Though SIMD simulations on the CM-2 are reasonably fast requiring a few seconds to tens of seconds for answering simple queries experiments indicate that MIMD simulations are vastly superior to SIMD simulations and offer hundredto thousand-fold speedups. This work provides new insights into the simulation of structured connectionist networks on massively parallel machines and is a step toward developing large yet efficient knowledge representation and reasoning systems. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-94-10. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/492 Massively Parallel Simulation of Structured Connectionist Networks: An Interim Report MS-CIS-94-10 LINC LAB 264 D. R. Mani Lokendra Shastri University of Pennsylvania School of Engineering and Applied Science Computer and Information Science Department Philadelphia, PA 19104-6389

[1]  James A. Hendler,et al.  Massively Parallel Support for Efficient Knowledge Representation , 1993, International Joint Conference on Artificial Intelligence.

[2]  A. Newell Unified Theories of Cognition and the Role of Soar , 1992 .

[3]  Dan I. Moldovan,et al.  Parallel processing - from applications to systems , 1993 .

[4]  Lokendra Shastri,et al.  Why Semantic Networks? , 1991, Principles of Semantic Networks.

[5]  D. R. Mani,et al.  Reflexive Reasoning with Multiple Instantiation in a Connectionist Reasoning System with a Type Hierarchy , 1993 .

[6]  David B. Skillicorn Models and Their Properties , 1994 .

[7]  Jordan B. Pollack,et al.  Massively Parallel Parsing: A Strongly Interactive Model of Natural Language Interpretation , 1988, Cogn. Sci..

[8]  G. Lakoff,et al.  Metaphors We Live By , 1980 .

[9]  Scott E. Fahlman,et al.  NETL: A System for Representing and Using Real-World Knowledge , 1979, CL.

[10]  Eugene Charniak,et al.  Passing Markers: A Theory of Contextual Influence in Language Comprehension* , 1983 .

[11]  John A. Barnden,et al.  Encoding techniques for complex information structures in connectionist systems , 1991 .

[12]  Michael G. Dyer,et al.  High-level Inferencing in a Connectionist Network , 1989 .

[13]  Jerome A. Feldman,et al.  Connectionist Models and Their Properties , 1982, Cogn. Sci..

[14]  Paul F. Dietz,et al.  A Lower Bound Result for the Common Element Problem and Its Implication for Reflex ive Reasoning , 1993 .

[15]  Seth Copen Goldstein,et al.  Active Messages: A Mechanism for Integrated Communication and Computation , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[16]  Bruce W. Porter,et al.  AI Research in the Context of a Multifunctional Knowledge Base: The BotanyKnowledge Base Project , 1988 .

[17]  Lokendra Shastri,et al.  A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition , 1993, IJCAI.

[18]  Dan I. Moldovan RUBIC: a multiprocessor for rule-based systems , 1989, IEEE Trans. Syst. Man Cybern..

[19]  Dan I. Moldovan,et al.  SNAP: parallel processing applied to AI , 1992, Computer.

[20]  W. Daniel Hillis,et al.  The connection machine , 1985 .

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

[22]  Lokendra Shastri,et al.  Rules and Variables in Neural Nets , 1991, Neural Computation.

[23]  Ramanathan V. Guha,et al.  Cyc: toward programs with common sense , 1990, CACM.

[24]  Eugene Charniak,et al.  Passing Markers: A Theory of Contextual Influence in Language Comprehension , 1983, Cogn. Sci..

[25]  Andreas Stolcke,et al.  The berkeley restaurant project , 1994, ICSLP.

[26]  L. Shastri,et al.  From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony , 1993, Behavioral and Brain Sciences.