プロダクションシステムの高コストルール対処法に関する一考察 : 直接条件照合の改善案

概要

論文の詳細を見る
Production systems are an established method for encoding knowledge in an expert system. A disadvantage of production systems is that they require a large amount of computation to perform the matching of the left-hand sides since they must not only determine whether or not a rule is satisfied, but also enumerate all ordered subsets of working memory elements satisfying a rule's left-hand side among all rules. In this paper we propose a match algorithm for production systems, which is a method for dealing with expensive productions in production systems. Expensive productions are rules which would be required the extraordinary time and space to match. This paper presents a method for reducing computer loads which are caused by expensive productions. To be more concrete, in order to decrease the number of combinations in matching, we propose a new data structure of α-memory such that, as a rule is given, it can immediately point out working memory elements satisfying the rule's condition element. Using this new α-memory, we present a method for dealing with expensive productions in production systems.
1996-07-01