计算机应用与软件2024,Vol.41Issue(2) :286-292,310.DOI:10.3969/j.issn.1000-386x.2024.02.041

基于多目标线性规划的本体冲突消除方法

ONTOLOGY CONFLICT ELIMINATION METHOD BASED ON MULTI-OBJECTIVE LINEAR PROGRAMMING

彭蔚 吴茂念 郝秀兰 朱绍军 郑博
计算机应用与软件2024,Vol.41Issue(2) :286-292,310.DOI:10.3969/j.issn.1000-386x.2024.02.041

基于多目标线性规划的本体冲突消除方法

ONTOLOGY CONFLICT ELIMINATION METHOD BASED ON MULTI-OBJECTIVE LINEAR PROGRAMMING

彭蔚 1吴茂念 1郝秀兰 1朱绍军 1郑博1
扫码查看

作者信息

  • 1. 湖州师范学院信息工程学院 浙江 湖州 313000;浙江省现代农业资源智慧管理与应用研究重点实验室 浙江 湖州 313000
  • 折叠

摘要

针对本体逻辑冲突消除传统方法未充分利用本体逻辑性质的缺陷,引入Shapley值法刻画本体逻辑性质,构建基于多目标0-1 整数线性规划的本体冲突消除方法,使用分层序列法求解多目标线性规划模型.其解遵循理性放弃原则,避免传统方法中目标权重的平均性或随机性.实验结果表明,采用该方法能够令解集遵循理性放弃原则的前提下,利用本体逻辑性质有效减少解集数量,从而提高决策效率.

Abstract

To recover the defect that the traditional method of ontology logic conflict elimination failed to fully utilize the logical properties of the ontology,a new method based on multi-objective 0-1 integer linear programming was proposed which introduced the Shapley value to depict the logic properties of ontology.To avoid the equilibrium or randomness of object weights in traditional methods,the hierarchical sequence algorithm was used to solve the multi-objective linear programming model,and its solution followed the principle of rational abandonment.The experimental results show that this algorithm can effectively reduce the number of solution sets and improve the decision-making efficiency by utilizing the logic property of ontology in the context that the solution set follows the principle of rational a-bandonment.

关键词

本体/逻辑冲突/多目标整数线性规划/最小不可满足子集/Shapley值法

Key words

Ontology/Logical contradictions/Multi-objective integer linear programming/Minimum unsatisfiable subset/Shapley value

引用本文复制引用

基金项目

国家自然科学基金项目(61906066)

浙江省教育厅专业学位研究生培养模式改革项目(Y202044192)

出版年

2024
计算机应用与软件
上海市计算技术研究所 上海计算机软件技术开发中心

计算机应用与软件

CSTPCD北大核心
影响因子:0.615
ISSN:1000-386X
参考文献量5
段落导航相关论文