= Solution
Write $\tau$ for the table. The positive initial <planning fluents> read from the original figure are
$$
\boxed{I=\{\operatorname{On}(A,\tau),\operatorname{On}(B,\tau),\operatorname{On}(C,A),\operatorname{Clear}(B),\operatorname{Clear}(C)\}.}
$$
The static type facts are $\operatorname{Block}(A)$, $\operatorname{Block}(B)$ and $\operatorname{Block}(C)$; the table is not a block. With an explicit table-availability <predicate>, take $\operatorname{Clear}(\tau)$ to be permanently true. Under the <closed-world assumption>, all other well-typed initial <planning fluents> are false; in particular, $A$ is not clear.
The goal is the partial-state <conjunction>
$$
\boxed{G=\operatorname{On}(A,B)\land\operatorname{On}(B,C).}
$$
It need not redundantly prescribe every final fact. With only these three blocks and a valid <blocks world> state, the completed stack also places $C$ on the table and leaves $A$ clear.
Back to article page
