For fast solvability detection, planning research therefore concentrates on polynomial-time solvable fragments of the plan existence problem.
we design a compilation of that ability into an AI Planning task Π, where unsolvability of Π -the absence of a path to the planning goal -implies infeasibility of e 0 .