A condition matching algorithm for high‐cost rules in production systems: Effectiveness measurements
Haruhiko Kimura, Shin‐Ya Kobayashi, Kazuyuki Sumiyoshi, Tsuyoshi Takebe · Systems and Computers in Japan · 1995
Abstract Production systems are well known as the most essential tools for developing expert systems. The most important problem to solve in a production system is that of speeding up its condition matching process. A production system quite often requires excessive matching time. This excessive computational time is normally caused by so‐called high‐cost rules that require a great deal of computational time. The objective of this paper is to develop an algorithm that can reduce the condition matching times of these high‐cost rules. An algorithm is presented here that can efficiently handle the high‐cost rules by reducing the worst case computational time for condition matching compared with the conventional Rete or Treat algorithms. An experiment was performed to demonstrate the effectiveness of the proposed algorithm high‐cost rules.