Two operational approaches to belief revision are presented in this paper. The rules of Rcalculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce al...Two operational approaches to belief revision are presented in this paper. The rules of Rcalculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.展开更多
文摘Two operational approaches to belief revision are presented in this paper. The rules of Rcalculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.
