描述逻辑ALC中关于伪子概念极小改变的R-演算

R-calculus for Pseudo-subconcept-ninimal Change in Description Logic ALC

AGM公设是用于信念修正的(被一个单一信念修正),而DP公设是用于迭代修正的(被一个有限的信念序列修正).李未给出了对于R-构型(configuration)Δ|Γ的R-演算,其中,Δ是一个原子公式或原子公式否定的集合,而Γ是一个有限的公式集合.为了在修正过程中能够保留断言中尽可能多的信息,将考虑一种新的极小改变的定义:伪子概念极小改变(■-极小改变),其中,■是一种伪子概念的关系;之后,在此基础上给出一种新的R-演算TDL,它是关于■-极小改变可靠和完备的,使得Δ|Γ在TDL中可以被约减为一个理论Δ∪Θ(记作TDL■Δ|Γ?Δ,Θ)当且仅当Θ是Γ关于Δ的一个■-极小改变.

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Δ.