%0 Journal Article
%T A Complete and Operational Approach to Belief Revision<br>信念修正的完全和可操作的方法
%A LI Wei
%A LUAN Shang-min
%A <br>李未
%A 栾尚敏
%J 软件学报
%D 2002
%I 
%X 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.
%K belief revision
%K belief set
%K iterated revision<br>信念修正
%K 信念集
%K 迭代修正
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=0A0F5B743190129E&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=CA4FD0336C81A37A&sid=6AC2A205FBB0EF23&eid=0401E2DB1F51F8DE&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=8