 If the operation of contraction uncompromisingly minimizes information loss, then \(K\div p\) will be one of the remainders. However, this construction can be shown to have implausible properties. A more reasonable recipe for contraction is to let \(K\div p\) be the intersection of some of the remainders. This is partial meet contraction, the major innovation in the classic 1985 paper by Carlos Alchourrón, Peter Gärdenfors and David Makinson. An operation of partial meet contraction employs a selection function that selects the “best” elements of \(K\bot p\). More precisely, a selection function for \(K\) is a function \(\gamma\) such that if \(K\bot p\) is non-empty, then \(\gamma(K\bot p)\) is a non-empty subset of \(K\bot p\). In the limiting case when \(K\bot p\) is empty, then \(\gamma(K\bot p)\) is defined to be equal to \(\{K\}\).