The AGM axiom system is for the belief revision (revision by a single belief), and the DP axiom system is for the iterated revision (revision by a finite sequence of beliefs). Li [1] gave an R-calculus for R-configura...The AGM axiom system is for the belief revision (revision by a single belief), and the DP axiom system is for the iterated revision (revision by a finite sequence of beliefs). Li [1] 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. In propositional logic programs, one R-calculus N will be given in this paper, such that N is sound and complete with respect to operator s(Δ,t), where s(Δ,t)is a pseudo-theory minimal change of t by?Δ.展开更多
The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R...The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R-configurations △|Γ, where Δ is a set of literals, and Γ is a finite set of formulas. We shall give two R-calculi such that for any consistent set Γ and finite consistent set △ of formulas in the propositional logic, in one calculus, there is a pseudo-revision Θ of Γ by Δ such that is provable and and in another calculus, there is a pre-revision Ξ of Γ by Δ such that is provable, and for some pseudo-revision Θ;and prove that the deduction systems for both the R-calculi are sound and complete with the pseudo-revision and the pre-revision, respectively.展开更多
A first order inference system, named R-calculus, is defined to develop the specifications. This system intends to eliminate the laws which are not consistent with users' requirements. The R-calculus consists of t...A first order inference system, named R-calculus, is defined to develop the specifications. This system intends to eliminate the laws which are not consistent with users' requirements. The R-calculus consists of the structural rules, an axiom, a cut rule, and the rules for logical connectives. Some examples are given to demonstrate the usage of the R-calculus. Furthermore, the properties regarding reachability and completeness of the R-calculus are formally defined and proved.展开更多
AGM postulates are for belief revision （revision by a single belief）, and DP postulates are for iterated revision （revision by a finite sequence of beliefs）. R-calculus is given for R-configurations △｜Г, where ...AGM postulates are for belief revision （revision by a single belief）, and DP postulates are for iterated revision （revision by a finite sequence of beliefs）. R-calculus is given for R-configurations △｜Г, where △ is a set of atomic formulas or the negations of atomic formulas, and Г is a finite set of formulas. We shall give two R-calculi C and M （sets of de- duction rules） such that for any finite consistent sets Г, △of formulas in the propositional logic, there is a consistent set ⊙ Г C of formulas such that △IГ → △, ⊙ is provable and⊙ is a contraction of F by A or a minimal change of F by A; and prove that C and M are sound and complete with respect to the contraction and the minimal change, respectively.展开更多
文摘The AGM axiom system is for the belief revision (revision by a single belief), and the DP axiom system is for the iterated revision (revision by a finite sequence of beliefs). Li [1] 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. In propositional logic programs, one R-calculus N will be given in this paper, such that N is sound and complete with respect to operator s(Δ,t), where s(Δ,t)is a pseudo-theory minimal change of t by?Δ.
文摘The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R-configurations △|Γ, where Δ is a set of literals, and Γ is a finite set of formulas. We shall give two R-calculi such that for any consistent set Γ and finite consistent set △ of formulas in the propositional logic, in one calculus, there is a pseudo-revision Θ of Γ by Δ such that is provable and and in another calculus, there is a pre-revision Ξ of Γ by Δ such that is provable, and for some pseudo-revision Θ;and prove that the deduction systems for both the R-calculi are sound and complete with the pseudo-revision and the pre-revision, respectively.
文摘A first order inference system, named R-calculus, is defined to develop the specifications. This system intends to eliminate the laws which are not consistent with users' requirements. The R-calculus consists of the structural rules, an axiom, a cut rule, and the rules for logical connectives. Some examples are given to demonstrate the usage of the R-calculus. Furthermore, the properties regarding reachability and completeness of the R-calculus are formally defined and proved.
文摘AGM postulates are for belief revision （revision by a single belief）, and DP postulates are for iterated revision （revision by a finite sequence of beliefs）. R-calculus is given for R-configurations △｜Г, where △ is a set of atomic formulas or the negations of atomic formulas, and Г is a finite set of formulas. We shall give two R-calculi C and M （sets of de- duction rules） such that for any finite consistent sets Г, △of formulas in the propositional logic, there is a consistent set ⊙ Г C of formulas such that △IГ → △, ⊙ is provable and⊙ is a contraction of F by A or a minimal change of F by A; and prove that C and M are sound and complete with respect to the contraction and the minimal change, respectively.
