利用自动机研究描述逻辑的推理问题

Using Automaton Research Description Logic Inference Question

首先介绍如何把描述逻辑转化为一个不确定型有穷自动机,分析这种转化过程中存在的问题,在B.Nebel的基础上提出了利用自动机的最小化理论对上述得到的自动机进行优化处理,以提高推理的效率。

This article first introduces how to translate the description logic into a indeterministic finite automaton, analyzes the question which in this kind of conversion process exists, In B. Nebel foundation, in order to effectively enhances the inference the efficiency, proposes to the automaton which above obtains carries on optimized processing using the automaton smallest theory.