About Partial Order Reduction in Planning and Computer Aided Verification


  • Martin Wehrle University of Basel
  • Malte Helmert University of Basel




heuristic search, classical planning, partial order reduction


Partial order reduction is a state space pruning approach that has been originally introduced in computer aided verification. Recently, various partial order reduction techniques have also been proposed for planning. Despite very similar underlying ideas, the relevant literature from computer aided verification has hardly been analyzed in the planning area so far, and it is unclear how these techniques are formally related. We provide an analysis of existing partial order reduction techniques and their relationships. We show that recently proposed approaches in planning are instances of general partial order reduction approaches from computer aided verification. Our analysis reveals a hierarchy of dominance relationships and shows that there is still room for improvement for partial order reduction techniques in planning. Overall, we provide a first step towards a better understanding and a unifying theory of partial order reduction techniques from different areas.




How to Cite

Wehrle, M., & Helmert, M. (2012). About Partial Order Reduction in Planning and Computer Aided Verification. Proceedings of the International Conference on Automated Planning and Scheduling, 22(1), 297-305. https://doi.org/10.1609/icaps.v22i1.13526