A Complete and Operational Approach to Belief Revision
信念修正的完全和可操作的方法

In this paper, two complete and operational approaches to the revision of a belief set represented by a set of propositional belief set are presented. First, the rules of R-calculus are modified in order to deduce all the minimally consistent subsets. Second, a set of rules is given in order to deduce all the maximally inconsistent subsets. Then, a procedure which can generate all the maximally consistent subsets is presented. They are complete approaches, since all the maximally consistent subsets can be generated.