プロダクションシステムの直積インスタンシエーション表現 : 効果測定

抄録

This paper demonstrates by experiment the efficiency of a proposed method for dealing with an expensive production such that the left-hand side can be decomposed into plural sets of interdependent condition elements. The method introduced a new simple notation expressing plural instantiations satisfying a rule's left-hand side, using direct products combining subsets of working memory elements. 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). 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.