Contraction and Revision over DL-Lite TBoxes
Contraction and Revision over DL-Lite TBoxes
复制标题
DOI：
10.1609/aaai.v28i1.8868
复制
发表时间：
2014-06
期刊：
影响因子：
--
通讯作者：
Zhiqiang Zhuang;Zhe Wang;Kewen Wang;G. Qi
中科院分区：
文献类型：
--
作者：
Zhiqiang Zhuang;Zhe Wang;Kewen Wang;G. Qi
描述逻辑本体管理的两个基本任务是消除有问题的公理和合并新形成的公理。在本文中，我们通过模型理论的方法来处理DL-Lite族的收缩和修正，标准DL语义产生了无限多的DL-Lite TBox模型，因此开发涉及DL模型的收缩和修正算法是不切实际的。我们的方法的关键是引入一种替代语义称为类型语义，这是更简洁的DL语义。更重要的是，在有限签名的情况下，类型语义总是产生有限的亨伯的模型.然后，我们定义了基于模型的收缩和修改的DL-Lite TBox类型语义下，并提供表示定理.最后，类型语义的简洁性允许我们开发易于处理的算法为这两个操作.
Two essential tasks in managing Description Logic (DL) ontologies are eliminating problematic axioms and incorporating newly formed axioms. Such elimination and incorporation are formalised as the operations of contraction and revision in belief change.In this paper, we deal with contraction and revision for the DL-Lite family through a model-theoretic approach.Standard DL semantics yields infinite numbers of models for DL-Lite TBoxes, thus it is not practical to develop algorithms for contraction and revision that involve DL models. The key to our approach is the introduction of an alternative semantics called type semantics which is more succinct than DL semantics. More importantly, with a finite signature, type semantics always yields finite humber of models.We then define model-based contraction and revision for DL-Lite TBoxesunder type semantics and provide representation theorems for them.Finally, the succinctness of type semantics allows us to develop tractable algorithms for both operations.