About partial order reduction in planning and computer aided verification

Wehrle, Martin and Helmert, Malte. (2012) About partial order reduction in planning and computer aided verification. In: Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). Atibaia, pp. 297-305.

PDF - Published Version

Official URL: http://edoc.unibas.ch/dok/A6043738

Downloads: Statistics Overview


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.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Helmert, Malte and Wehrle, Martin
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:19 Nov 2018 16:31
Deposited On:13 Sep 2013 07:57

Repository Staff Only: item control page