The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We describe a duality mapping between STRIPS planning tasks. By exchanging the initial and goal conditions, taking their respective complements, and swapping for every action its precondition and delete list, one obtains for every STRIPS task its dual version, which has a solution if and only if the original does. This is proved by showing that the described transformation essentially turns progression (forward search) into regression (backward search) and vice versa. The duality sheds newarXiv:1304.0897v1 fatcat:dp2hj44osngbpbjfeao2wuhiiq