摘要
推理时间随着所依赖的本体体积增大而增加,所以模块化是优化推理的一种有效手段。文章提出了一种在EL++本体中使用符号边界计算公理模块的方法,该方法通过分析符号解释域边界和公理之间的关系来计算推理任务的公理模块。文中给出了方法的理论基础并证明了模块相对于推理任务的正确性。在EL++本体上实现了基于边界的公理模块提取算法,通过在现实的本体上进行实验评估,证明文中方法产生的公理模块和最优模块大小非常接近,且提取速度非常快,适合对推理进行优化。
Modularization is a promising technique to meet the tologies. In this paper, a novel axiom-based module extraction EL^＋＋ ontologies. The of boundaries of symbo scalability challenge in reasoning with very large onapproach by using boundary method is introduced for proposed method is capable of identifying relevant axioms in an ontology based on the notion ls, with respect to a given reasoning task. We present definitions and propositions relevant to boundary of symbols. Based on the formulization, we proved that axiom-based modules extracted by using boundary method are correct for the reasoning task. A practical algorithm for computing axiom-based modules by using boundary method is given and implemented for EL^＋＋. Experimental results on real-world ontologies show that axiom-based modules generated by our method are very close to the optimal result, the average size of our module is less than double size of the optimal one; the extraction process has good run-time performance, and it can be accomplished in about one second when the extracted ontology is on the scale of 1 × 10^4. Therefore, module extraction by using boundary method is suitable for optimizing ontology reasoning.
出处
《西北工业大学学报》
EI
CAS
CSCD
北大核心
2010年第3期353-357,共5页
Journal of Northwestern Polytechnical University
基金
教育部新教师基金(20096102120037)
国家自然科学基金(6067501)资助
关键词
公理模块
边界方法
本体
推理优化
模块提取
axiom-based module, boundary method, ontology, reasoning optimization, module extraction
作者简介
方俊（1981-），西北工业大学讲师，主要从事逻辑推理和语义网的研究。
