专家系统规则启发式划分和并行推理
来源期刊：中南大学学报(自然科学版)1989年第6期
论文作者：贾维嘉
文章页码：651 - 657
关键词：规则； 并行处理； 置换； 人工智能/启发式划分； 进程
Key words：rule； parallel processing； substitution； artificial intelligence/heuristic partition； processes
摘 要：本文提出了一个启发式规则划分办法并分析了并行规则推理的代价,设规则集合被划分为π=（π1,π2,…,πk）,则对于任何一个规则Ri∈πi,在πi-1中至少有某个Ri,Ri与Ri在某种代换下相关,如果串行推理对规则进行一次遍历所费时间代价为C,对于同样规则划分π进行多处理机或进程并行推理一遍遍历代价至多为C′,C′≤（k/#R）C。其中#R是规则集合R的基数,同时给出一个实例和推理代价的实验数据。
Abstract: A heuristic rule set partition was presented in this paper. The partition is based on rule unification under some substitutions. Define a partition as follows: π= (π1, π2, …πk) For each rule in πi is unified with at least one rule in the πi-1, where i=2 to k. According to the partition, we implemented a concurrent forward chaining and backword chaining system with Object-Oriented Programming Language (Smalltalk- 80) on Sun station. For rule execution sequence E=(e1, e2, …, et) the cost of executing ei would be: C(ei) But the concurrent rule driving cost for the sequence will be C’ = (K/#R)C(ei) where #R is the number of rules. We compare concurrent rule driving with sequential inference, (16 rules and 7 facts) the result is 480 milliseconds against 4000--4600 milliseconds.
