Towards connectionist production systems

Abstract This article describes a connectionist architecture, CAPS, for implementing production systems programmed in the OPS5 language. CAPS illustrates the potential benefits and obstacles in using artificial neural networks (i.e., connectionist networks) in expert systems. The main objective of CAPS is to enhance the performance of existing rule-based OPS5 programs (e.g., expert systems) by implementing them on connectionist networks. CAPS supports a subset of the OPS5 language which includes variables, negation, conjunction, and disjunction of conditions. It uses a translation program to transform an OPS5 program into a limitedly interconnected, fully trained neural network. The translation program eliminates the learning/training phase in creating a network. CAPS resolves the variable binding problems normally associated with connectionist architectures by using local representations. Local representations also simplify the overall architecture and reduce the number of interconnections within the network, thus increasing the feasibility of hardware implementations. A hardware implementations of a CAPS network can potentially provide an 80- to 200- fold increase in parallelism over serial implementations, allowing significant increases in production system performance. Although CAPS advances the state of connectionist production systems, it still has some problems and limitations, particularly in handling simultaneously matched variables and performing conflict resolution. The CAPS architecture has been tested by transforming small OPS5 programs into connectionist networks and simulating them on a connectionist simulator. In addition, various cases of the classic Monkey and Bananas program have been successfully simulated. CAPS demonstrates that connectionist architectures can perform rule-based symbolic reasoning and support dynamic variable bindings.

[1]  A Gupta,et al.  Parallelism in production systems: the sources and the unexpected speed up , 1986 .

[2]  John P. McDermott,et al.  R1: A Rule-Based Configurer of Computer Systems , 1982, Artif. Intell..

[3]  J. Bailey,et al.  Why VLSI implementations of associative VLCNs require connection multiplexing , 1988, IEEE 1988 International Conference on Neural Networks.

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

[5]  Mark A. Fanty,et al.  Computing with structured connectionist networks , 1988, CACM.

[6]  Stephen I. Gallant,et al.  Connectionist expert systems , 1988, CACM.

[7]  Jerome A. Feldman,et al.  Connectionist models and their implications , 1988 .

[8]  Geoffrey E. Hinton,et al.  A Distributed Connectionist Production System , 1988, Cogn. Sci..

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

[10]  Paul P. Dasiewicz,et al.  MAPPS: A VLSI multiprocessor for the execution of production system programs , 1987, Microprocess. Microprogramming.

[11]  Allen Newell,et al.  Initial Assessment of Architectures for Production Systems , 1984, AAAI.

[12]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[13]  Victoria Y. Yoon,et al.  Desknet: The dermatology expert system with knowledge-based network , 1988, Neural Networks.

[14]  Geoffrey E. Hinton,et al.  Connectionist Architectures for Artificial Intelligence , 1990, Computer.

[15]  R. E. Seviora,et al.  Performance of OPS5 matching on CUPID , 1989, Microprocessing and Microprogramming.