The RETE algorithm had a great impact on the development of efficient production systems by providing a fast pattern matching mechanism for activation. No similar mechanism has been available to speed up activation and scheduling in blackboard systems. In this paper we describe efficient, general-purpose efficiency mechanisms that are better suited to blackboard systems than RETE-like networks. We describe a knowledge source compiler that produces match networks and demons for efficient activation and rating while compiling the entire system for increased execution speed. Experiments using the enhancements in a general-purpose blackboard shell illustrate a substantial improvement in run time, including an 80-92% decrease in activation time. The mechanisms we describe are general enough to be used in most existing blackboard systems.
|Number of pages||6|
|State||Published - 1994|
|Event||Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) - Seattle, WA, USA|
Duration: Jul 31 1994 → Aug 4 1994
|Conference||Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2)|
|City||Seattle, WA, USA|
|Period||07/31/94 → 08/4/94|