Hitherto, the consistency assumption has been deemed to be strong and it suffices for the purposes of proving certain important properties of the A* algorithm to use either of two weaker versions, viz. monotone criterion and monotone restriction. Here, we show that the opposite is true -- the consistency assumption is not only weaker, but sufficient. Moreover, it implies admissibility.
/lp/association-for-computing-machinery/on-the-consistency-assumption-monotone-criterion-and-the-monotone-N0dEoZ1m0A