HAL: a faster match algorithm
Tóm tắt
Existing match algorithms treat the matching process like the querying process of relational databases. Owing to the combinatorial nature of the matching process, the match time greatly varies in different recognize-act cycles. Current match algorithms utilize local matching support networks with redundant working memory elements shared among rules involving the same classes. Since the match time is a dominant factor in the total execution time of a production system, such large match time makes production systems with existing match algorithms unsuitable for many applications. To reduce match time, we introduce the Heuristically-Annotated-Linkage (HAL) match algorithm. HAL differs from traditional match algorithms in that HAL employs a fixed-traversal-distance pseudobipartite network approach of treating rules and classes as objects, or nodes, in only one global pseudobipartite-graph-like connection and communication scheme. In addition, HAL is more efficient than other existing match algorithms because it is capable of immediate characterization of any new datum upon arrival. This paper reviews existing match algorithms, presents HAL, and analyzes the performance of HAL in comparison with existing algorithms.
Từ khóa
#Production systems #Expert systems #Relational databases #Heuristic algorithms #Performance analysis #Algorithm design and analysis #Knowledge based systems #Database systems #Explosions #Inference algorithmsTài liệu tham khảo
S.J. Biondo, Fundamentals of Expert Systems Technology: Principles and Concepts. Norwood, N.J.: Ablex, 1990.
10.1109/69.368520
10.1109/IPPS.1993.262782
A.M.K. Cheng and H.-Y. Tsai, \“A Graph-Based Approach for Timing Analysis and Refinement of OPS5 Knowledge-Based Systems,\” IEEE Trans. Knowledge and Data Eng., to appear.
10.1016/0004-3702(82)90020-0
J. Giarratano and G. Riley, Expert Systems Principles and Practice. PWS Publishing, 1993.
J.P. Ignizio, Introduction to Expert Systems: The Development and Implementation of Rule-Based Expert Systems. McGraw-Hill, 1991.
J. McDermott, A. Newell and J. Moore, \“The Efficiency of Certain Production System Implementations,\” Pattern-Directed Inference Systems, pp. 155-176, 1978.
10.1109/2.67208
D.P. Miranker, \“TREAT: A New and Efficient Match Algorithm for AI Production Systems,\” Proc. Nat"l Conf. Artificial Intelligence, pp. 42-47, Aug. 1987.
10.1109/TAI.1989.65350
10.1109/TAI.1991.167028
Software Technology Branch, \“CLIPS Basic Programming Guide Version 6.0,\” L.B.J. Space Center, pp. 26-29, June 1993.
10.1016/0004-3702(94)90097-3
10.1109/ICNN.1994.374471
10.1109/REAL.1990.128757
C.-Y. Wang and A.M.K. Cheng, \“Increasing Production System Parallelism via Synchronization Minimization and Check-Ahead Conflict Resolution,\” Proc. Int"l Conf. Parallel Processing, Oconomovoc, WI, vol. 3, pp. 85-92, Aug. 1995.