The extensions for logic-based knowledge bases with integrity constraints are rather popular. We put forward an alternative criteria for analysis of integrity constraints in Web ontology language （OWL） ontology unde...The extensions for logic-based knowledge bases with integrity constraints are rather popular. We put forward an alternative criteria for analysis of integrity constraints in Web ontology language （OWL） ontology under the closed world assumption. According to this criteria, grounded circumscription is applied to define integrity constraints in OWL ontology and the satisfaction of the integrity constraints by minimizing extensions of the predicates in integrity con- straints. According to the semantics of integrity constraints, we provide a modified tableau algorithm which is sound and complete for deciding the consistency of an extended ontol- ogy. Finally, the integrity constraint validation is converted into the corresponding consistency of the extended ontology. Comparing our approach with existing integrity constraint validation approaches, we show that the results of our approach are more in accordance with user requirements than other approaches in certain cases.展开更多
基金Acknowledgements This work was supported in part by the National Natural Science Foundation of China （Grant Nos. 61133011, 41172294, 61003101, 61170092） Jilin Province Science and Technology Development Plan （20101501, 20100185, 201101039）+2 种基金 Doctoral Fund of Ministry of Edu- cation of China （20100061110031） Opening Fund of Top Key Discipline of Computer Software and Theory in Zhejiang Provincial Colleges at Zhejiang Normal University （ZSDZZZZXK12） Jilin University Doctoral Interdisci- plinary Research Funded Project （2012JC012）.
文摘The extensions for logic-based knowledge bases with integrity constraints are rather popular. We put forward an alternative criteria for analysis of integrity constraints in Web ontology language （OWL） ontology under the closed world assumption. According to this criteria, grounded circumscription is applied to define integrity constraints in OWL ontology and the satisfaction of the integrity constraints by minimizing extensions of the predicates in integrity con- straints. According to the semantics of integrity constraints, we provide a modified tableau algorithm which is sound and complete for deciding the consistency of an extended ontol- ogy. Finally, the integrity constraint validation is converted into the corresponding consistency of the extended ontology. Comparing our approach with existing integrity constraint validation approaches, we show that the results of our approach are more in accordance with user requirements than other approaches in certain cases.
