The problems in this category are all problems in the realm of Blocks World planning. You are given the following English description of the problem. Each problem in this category will include as premises all of the ground atomic sentences known to be true of the initial state together with a sentence defining the acceptable goal states.
There are three relations for describing the state of the world.
(on x y s) asserts that block x is on block y in state s
(table x s) asserts that block x is on the table in state s
(clear x s) asserts that block x has no block on top of it in state s
There are three actions, modeled as functions constants.
(m x y z) refers to the action of moving x from y to z.
(s x y) refers to the action of taking x from table and putting it on y
(u x y) refers to the action of taking x from y and putting it on table
In addition, there is a function constant to relate actions and states
(do a s) refers to the state that results from doing action a in state s
To produce a plan, we will ask your reasoner to prove a sentence of the form Ex.(goal ?x). If one were to use answer extraction the ?x would be bound to something like (do (s a b) (do (s b c) s1)). This answer signifies that the plan of stacking b onto c in the initial state and then stacking a onto b produces a goal state.
Your solution will contain the following:
Background Axioms
your set of axioms that capture the effects of the actions above
Sample Premises
(clear b s1) (on b c s1) (on c a s1) (table a s1) (<= (goal ?s) (on a b ?s) (on b c ?s))
Sample Conclusion
(goal ?s)