摘要
给出了命题逻辑上信念修正的两种可操作的完全方法.首先对R-演算的规则进行了修改,使得对任何一个极大协调的子集都通过这组规则得到.然后,给出了求得所有的极小不协调子集的一组规则.最后,给出一个过程,该过程能求得所有的极大协调子集.因为这两种方法都能求得所有的极大协调子集,所以把它们称为完全的.
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.
出处
《软件学报》
EI
CSCD
北大核心
2002年第1期49-64,共16页
Journal of Software
基金
国家自然科学基金资助项目(60033020
60103020)
中国博士后科学基金资助项目~~
