Maximal Invariable Update Operator Based on Splitting
There are a very large number of beliefs in an agent generally.Now many re,archers think that efficient belief revision should be performed only in the part of its relevant states at a time.So Parikh proposed relevance criterion and showed that AGM belief change operations do not always satisfy it.By introducing the notion of maximal invariable partial meet contraction into AGM model,we obtain a class of partial meet contractions that satisfy Parikhs relevance criterion.It benefits computing an update operator by a local update one.Together with the notion of essential letter,an open problem which proposed by Makinson was resolved.
Belief change Splitting language Maximal invariable
Maonian Wu Mingyi Zhang
College of Computer Science & Technology,Guizhou University,P.R.China Guizhou Academy of Sciences,P.R.China
国际会议
成都
英文
418-425
2008-05-17（万方平台首次上网日期，不代表论文的发表时间）