分解法求极大公共一般式

COMPUTING MCGS BY PAIRING TECHNIQUE

在人工智能中,计算极大公共一般式是归纳推理的一个重要环节。本文提出一种多项式时间的近似计算方法。

Computing Maximal Common Generalization (MCG) is an essential role in Inductive Reasoning, an active subjet on Artificial Intelligence. This paper proposes a polynomial algorithm for approximately computing MCGs.