Encoding of Production Rules in a Connectionist Network

Article type: Research Article

Authors: Sanou, Katsuaki^; | Romaniuk, Steve G. | Hall, Lawrence O.

Affiliations: Department of Computer Science and Engineering, ENB 118, University of South Florida, Tampa, FL 33620-5399, e-mail: [email protected]

Note: [] On leave from Kawasaki Steel Corporation, Systems Laboratory, Makuhari Techno Graden, 1-3 Nakase, Mihama-ku Chiba 261, Japan.

Abstract: The task of implementing a simple rule-based production system in a connectionist architecture is discussed. To implement a connectionist-based production system, it is essential to be capable of representing explicit rules by means of simple neuronlike computing units. The architecture described here uses a local representation based upon the instance oriented symbolic/connectionist expert system SC net. The problems of variable binding and variable value instantiation are solved in the context of this system. The network is built such that only one value is bound to a variable during each rule firing cycle. Issues regarding serialization and working memory consistency are also solved. An example implementation, the Farmer's Dilemma planning problem, is given to illustrate the potential of this approach. The article shows how many different rule bases may be mapped onto a connectionist architecture for parallel execution.

DOI: 10.3233/IFS-1996-4101

Journal: Journal of Intelligent and Fuzzy Systems, vol. 4, no. 1, pp. 1-18, 1996