摘要
提出了一种将特定缺省规则转换成描述逻辑Abox实例的推理算法,该算法针对特定缺省规则的改变通常不影响Tbox的情况,将缺省规则映射成为Abox中实例的变化,简化了推理过程,同时保持描述逻辑推理的可判定性,具有较好的可行性,并通过推理实例验证了该算法的有效性.
A reasoning algorithm which transfers special default rules into instances in Abox is proposed.The algorithm is designed based on the case that the change of special default rules cannot affect Tbox.So the change can be mapped into the change of Abox.It can simply the inference process,at the same time the determination is not changed.The algorithm has good feasibility.Finally a reasoning example is shown to validate the effectivity of the algorithm.
出处
《微电子学与计算机》
CSCD
北大核心
2011年第3期111-114,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(60974076)
国家重点实验室开放基金项目(SKLSE20080718)
关键词
描述逻辑
缺省规则
推理算法
description logic
default rules
reasoning algorithm
