| 摘要: |
| AGM公设是用于信念修正的（被一个单一信念修正），而DP公设是用于迭代修正的（被一个有限的信念序列修正）.李未给出了对于R-构型（configuration）△|Γ的R-演算，其中，△是一个原子公式或原子公式否定的集合，而Γ是一个有限的公式集合.为了在修正过程中能够保留断言中尽可能多的信息，将考虑一种新的极小改变的定义：伪子概念极小改变（≤-极小改变），其中，≤是一种伪子概念的关系；之后，在此基础上给出一种新的R-演算TDL，它是关于≤-极小改变可靠和完备的，使得△|Γ在TDL中可以被约减为一个理论△∪Θ（记作├TDL △|Γ⇒△，Θ）当且仅当Θ是Γ关于△的一个≤-极小改变. |
| 关键词: 描述逻辑 信念修正 R-演算 伪子概念 ≤-极小改变 |
| DOI：10.13328/j.cnki.jos.005596 |
| 分类号:TP18 |
| 基金项目:国家重点基础研究发展计划（973）（2005CB321901）；软件开发环境国家重点实验室开放课题（SKLSDE-2010KF-06） |
|
| R-calculus for Pseudo-subconcept-ninimal Change in Description Logic ALC |
|
WANG Yu-Hui1,2,3, SUI Yue-Fei1,2
|
|
1.Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China;2.School of Computer and Control Engineering, University of Chinese Academy of Sciences, Beijing 100049, China;3.Information Technology Center, China Reinsurance(Group) Corporation, Beijing 100033, China
|
| Abstract: |
| The AGM postulates are for the belief revision (revision by a single belief), and the DP postulates are for the iterated revision (revision by a finite sequence of beliefs). Li gave an R-calculus for R-configurations △|Γ, where △ is a set of atomic formulas or the negations of atomic formulas, and Γ is a finite set of formulas. With an idea to preserve as much as possible information of statements to be revised, another definition of the minimal change is considered:pseudo-subconcept-minimal (≤-minimal) change, where ≤ is the pseudo-subconcept relation, and then give a new R-calculus TDL which is sound and complete with respect to ≤-minimal change such that △|Γ is reduced to a theory △∪Θ in TDL (denoted by ├TDL △|Γ⇒△,Θ) if and only if Θ is a ≤-minimal change of Γ by △. |
| Key words: description logics belief revision R-calculus pseudo-subconcepts ≤-minimal change |
