摘要
理解复杂决策问题的关键在于使决策问题所包含的领域、目标、状态、结构等信息被系统所"读懂".本文利用本体表达语义,实现了问题语义关系表示和语义计算.在保持理解结果不变的原则上,本文提出利用语义迭代方法将计算机无法理解的问题语义转化为可完全理解的语义.本文给出了语义精炼方法并形成最优闭合问题空间,在结构复杂度和内容复杂度两方面具有最低复杂度.实验分析表明,本文提出的复杂决策问题语义理解方法是有效的.
A key challenge of complicated decision problem understanding is to make the information of decision problem,i. e. domain, goal, status and structure, readable and understandable for decision support system. This paper introduces ontology to describe semantics, and then problem semantic relationship and semantic computation are presented. Based on the rule of keeping the understanding results unchanged, semantic iteration method is addressed in order to transform the decision problem semantics, which cannot be analyzed through ontology, into fully understandable problem semantic. Further, semantic refining method is presented so that each complicated decision problem space can be refined into a most optimized closed problem space with a minimum complexity, which can be calculated from two facets: structure complexity and content complexity of problem space. Experiments show that the method of complicated decision problem semantic analysis is effective and feasible.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2012年第8期1603-1608,共6页
Acta Electronica Sinica
基金
国家自然科学基金(No.61103069
No.71171148)
关键词
本体
语义理解
语义迭代
语义精炼
最优闭合问题空间
ontology
semantics understanding
semantics iteration
semantics refining
most optimized closed problem space