 (2) If partial meet contraction is instead performed on a belief base for \(K\), then recovery can be avoided. Let the belief base be \(\{p_1 ,\ldots ,p_n, c, h\}\), where the background beliefs \(p_1 ,\ldots ,p_n\) are unrelated to \(c\) and \(h\), whereas \(h\) logically implies \(c\). Then \(K = \Cn(\{p_1 ,\ldots ,p_n, c, h\})\). Since \(h\) implies \(c\), it will have to go when \(c\) is removed, so that \(K\div c = \Cn(\{p_1 ,\ldots ,p_n\})\). When \(c\) is reinserted, the outcome is \((K\div c)+c = \Cn(\{p_1 ,\ldots ,p_n, c\})\) that does not contain \(h\), as desired.