רונן ברפמן

We investigate the ability of two central encoding methods to propagate reachability and relevance information using resolution steps. More specifically, we compare the ability of unit-propagation and higher-order resolution steps to propagate reachability and relevance information in the context of the linear and GRAPHPLAN encoding schemes to the ability of a natural class of reachability and relevance algorithms that operate at the plan level. As a result of our observations and additional considerations, we experiment with a preprocessing step based on limited binary resolution that shows nice results.