Inconsistencies or conflicts appearing in the integration of ontologies and general rules are handled by applying prioritizing and updating. First, a prioritized knowledge base is obtained by weighting information wei...Inconsistencies or conflicts appearing in the integration of ontologies and general rules are handled by applying prioritizing and updating. First, a prioritized knowledge base is obtained by weighting information weight. Then, based on the idea ＂abandoning the old for the new＂, the weight of each rule is greater than that of the information in ontologies. If ontologies conflict with general rules, then a new knowledge-base without any inconsistency or conflict is obtained by using rules with big weight updating information in ontologies with small weight. Thus, current logic programming solvers and description logic reasoners are employed to implement the reasoning services, such as querying etc. Updating based on prioritizing is more suitable for handling inconsistencies than other approaches to introducing non-standard semantics if knowledge bases are dynamically evolving. Moreover, a consistent knowledge base can be always maintained in the dynamical environment by updating outdated information with new information based on weighting. Finally, this approach to dealing with inconsistencies is feasibly exemplified.展开更多
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.展开更多
基金The National Natural Science Foundation of China (No60973003)
文摘Inconsistencies or conflicts appearing in the integration of ontologies and general rules are handled by applying prioritizing and updating. First, a prioritized knowledge base is obtained by weighting information weight. Then, based on the idea ＂abandoning the old for the new＂, the weight of each rule is greater than that of the information in ontologies. If ontologies conflict with general rules, then a new knowledge-base without any inconsistency or conflict is obtained by using rules with big weight updating information in ontologies with small weight. Thus, current logic programming solvers and description logic reasoners are employed to implement the reasoning services, such as querying etc. Updating based on prioritizing is more suitable for handling inconsistencies than other approaches to introducing non-standard semantics if knowledge bases are dynamically evolving. Moreover, a consistent knowledge base can be always maintained in the dynamical environment by updating outdated information with new information based on weighting. Finally, this approach to dealing with inconsistencies is feasibly exemplified.
基金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.
