Currently, knowledge-based sharing and service system has been a hot issue and knowledge fusion, especially for implicit knowledge discovery, becomes the core of knowledge processing and optimization in the system. In...Currently, knowledge-based sharing and service system has been a hot issue and knowledge fusion, especially for implicit knowledge discovery, becomes the core of knowledge processing and optimization in the system. In the research, a knowledge fusion framework based on agricultural ontology and fusion rules was pro- posed, including knowledge extraction, clearing and annotation modules based on a- gricultural ontology, fusion rule construction, choosing and evaluation modules based on agricultural ontology and knowledge fusion module for users＇ demands. Finally, the significance of the framework to system of agricultural knowledge services was proved with the help of a case.展开更多
To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-b...To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-based model considers an optimization problem of minimizing a linear objective function which is suitable for selecting the minimal number of axioms to remove when revising ontologies.Based on the incision function,a revision algorithm is proposed to apply ILP to all minimal incoherence-preserving subsets(MIPS).Although this algorithm can often find a minimal number of axioms to remove,it is very time-consuming to compute MIPS.Thus,an adapted revision algorithm to deal with unsatisfiable concepts individually is also given.Experimental results reveal that the proposed ILP-based revision algorithm is much more efficient than the commonly used algorithm based on the hitting set tree.In addition,the adapted algorithm can achieve higher efficiency,while it may delete more axioms.展开更多
Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consisten...Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consistent subsets using minimal inconsistent sets and a resolution method, to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a minimal explanation for the inconsistency of a given ontology. Thus, it can replace the consistency checking operation, which is executed frequently in existing approaches. When selecting subsets of the inconsistent ontology, formulas which can be directly or indirectly resolved with the negation of the query formula are selected because only those formulas affect the consequences of the reasoner. Therefore, the complexity of the reasoning processing is significantly reduced. Tests show that the run-time performance of the inconsistency reasoner is significantly improved.展开更多
基金Supported by Specialized Funds of CASIndividual Service System of Agricultural Information in Tibet(2012-J-08)+1 种基金Science and Technology Funds of CASMultimedia Information Service in Rural Area based on 3G Information Terminal(201219)~~
文摘Currently, knowledge-based sharing and service system has been a hot issue and knowledge fusion, especially for implicit knowledge discovery, becomes the core of knowledge processing and optimization in the system. In the research, a knowledge fusion framework based on agricultural ontology and fusion rules was pro- posed, including knowledge extraction, clearing and annotation modules based on a- gricultural ontology, fusion rule construction, choosing and evaluation modules based on agricultural ontology and knowledge fusion module for users＇ demands. Finally, the significance of the framework to system of agricultural knowledge services was proved with the help of a case.
基金The National Natural Science Foundation of China(No.61602259,U1736204)Research Foundation for Advanced Talents of Nanjing University of Posts and Telecommunications(No.NY216022)the National Key Research and Development Program of China(No.2018YFC0830200).
文摘To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-based model considers an optimization problem of minimizing a linear objective function which is suitable for selecting the minimal number of axioms to remove when revising ontologies.Based on the incision function,a revision algorithm is proposed to apply ILP to all minimal incoherence-preserving subsets(MIPS).Although this algorithm can often find a minimal number of axioms to remove,it is very time-consuming to compute MIPS.Thus,an adapted revision algorithm to deal with unsatisfiable concepts individually is also given.Experimental results reveal that the proposed ILP-based revision algorithm is much more efficient than the commonly used algorithm based on the hitting set tree.In addition,the adapted algorithm can achieve higher efficiency,while it may delete more axioms.
基金Supported by the Specialized Research Fund for the Doctoral Program of Higher Education of MOE, P.R.C (No.20096102120037)
文摘Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consistent subsets using minimal inconsistent sets and a resolution method, to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a minimal explanation for the inconsistency of a given ontology. Thus, it can replace the consistency checking operation, which is executed frequently in existing approaches. When selecting subsets of the inconsistent ontology, formulas which can be directly or indirectly resolved with the negation of the query formula are selected because only those formulas affect the consequences of the reasoner. Therefore, the complexity of the reasoning processing is significantly reduced. Tests show that the run-time performance of the inconsistency reasoner is significantly improved.
