Prove the following assertions about
planning graphs:
-
A literal that does not appear in the final level of the graph cannot be achieved.
-
The level cost of a literal in a serial graph is no greater than the actual cost of an optimal plan for achieving it.