ONTOLOGY CONFLICT ELIMINATION METHOD BASED ON MULTI-OBJECTIVE LINEAR PROGRAMMING
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.
OntologyLogical contradictionsMulti-objective integer linear programmingMinimum unsatisfiable subsetShapley value
万方数据
维普
