The complexity of action redundancy

An action is redundant in a planning domain if it is not needed to reach the goal. In this paper, we study the computational complexity of some problems related to the redundancy of actions: checking whether a domain contains a redundant action, what is the minimal number of actions needed to make the goal reachable, checking whether the removal of an action does not increase the minimal plan length, etc.