%0 Journal Article
%T Operational and Complete Approaches to Belief Revision
%A LI Wei
%A LUAN Shangmin
%A <br>LI Wei
%A LUAN Shangmin
%J 计算机科学技术学报
%D 2000
%I 
%X 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.
%K belief revision
%K belief set
%K maximal consistent subset<br>计算机数学
%K 相信修正
%K 最大相容集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=DAEF7C402F80035154B21328B65F9F62&yid=9806D0D4EAA9BED3&vid=23CCDDCD68FFCC2F&iid=38B194292C032A66&sid=974CBB04624305A1&eid=D2742EEE6F4DF8FE&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=10