In this paper we introduce an operational procedure which, given an avoiding sure loss (ASL) imprecise probability assessment P on an arbitrary finite set of conditional events, determines its ‘least-committal’ coherent correction, i.e. the coherent imprecise probability assessment which reduces the imprecision of P as little as possible, without ever increasing it. Besides, a new proof of the consistency of a known procedure, which checks the ASL condition, is supplied by introducing a technique employed also in the proof of the previous procedure. It is then shown that the two procedures can be ‘merged’ to obtain an algorithm to be used when it is not known a priori whether P is ASL.
