Several people have told me that the postponement heuristic corresponds to a method in Richard Bellman's dynamic programming. Apparently this isn't true. Dynamic programming does not provide for a complete rearrangement of the goals before it is decided what goal to work on first.
.dvi, .pdf and .ps versions are also available.
Up to: McCarthy home page
I welcome comments, and you can send them by clicking on jmc@cs.stanford.edu