By Topic

A meta-level control architecture for production systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ishida, T. ; Dept. of Inf. Sci., Kyoto Univ., Japan ; Sasaki, Y. ; Nakata, K. ; Fukuhara, Y.

Recent production system applications have been experiencing exceedingly difficult software maintenance problems. This is because the control of rule firings has been buried in the production rules themselves. To cope with this problem, we propose a meta-level control architecture for production systems, where procedural programming languages, such as Lisp and C, are employed to explicitly describe the control plans of production systems. The key idea of the architecture is to view production systems as a collection of independent rule processes, each of which monitors the global database and performs actions when its conditions are satisfied by the database. Procedural Control Macros (PCMs), which are based on C.A.R. Hoare's (1978) CSP, are then introduced into procedural programming languages to establish communication with the collection of rule processes. Although the PCMs are simple and easy to implement, the readability and maintainability of production system applications are greatly enhanced. Together with the original facilities of procedural languages, the PCMs enable users to efficiently specify the control plans for production systems. Furthermore, since control information is gathered into control plans, production rules can be declarative and thereby application-independent. This new feature makes it possible to develop large-scale shared rule bases

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:7 ,  Issue: 1 )