Credible Models of Belief Update

In this work, we address one important problem of Katsuno and Mendelzon update operators, that is to require that any updated belief base must entail any new input in a consistent way. This assumes that any situation can be updated into one satisfying that input, which is unrealistic. To solve this problem, we must relax either the success or the consistency principle. Each case leads to a distinct family of update operators, that we semantically characterize by plausibility relations over possible worlds, considering a credibility limit that aims to forbid unrealistic changes. We discuss in which cases one family is more adequate than the other one