On the consistency assumption, monotone criterion and the monotone restriction

  • Authors:
  • James B. H. Kwa

  • Affiliations:
  • University of Edinburgh, Edinburgh, UK

  • Venue:
  • ACM SIGART Bulletin
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.