Publication at Faculty of Mathematics and Physics |
2007
Abstract
We concentrate on solving a problem of finding supporting actions for a goal. This problem arises as a sub-problem many times during search for a solution of planning problems in GraphPlan algorithm.
We showed in this paper that the supports problem is NP-complete. In order to improve the solving process of supports problems we proposed a new global consistency technique which we call a projection consistency.
