プロダクションシステムの高コストルール対処法 : 効果測定

抄録

This paper demonstrates by experiment the efficiency of a proposed method for dealing with expensive productions in production systems. Production systems are an established method for encoding knowledge in an expert system. Expensive productions are rules which would be required the extraordinary time and space to match (for each rule, compare the left-hand side against the current working memory). The method for dealing with expensive productions in this paper exploits a simple notation expressing plural instantiations satisfying a rule's left-hand side, using direct products combining subsets of working memory elements. We compare the proposed match algorithm with RETE match algorithm in both the execution time and space. Evaluation results demonstrate the proposed method is more efficient than RETE match algorithm.