On Weak Stubborn Sets in Classical Planning

Sievers, Silvan and Wehrle, Martin. (2021) On Weak Stubborn Sets in Classical Planning. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. pp. 4167-4174.

[img] PDF - Accepted Version

Official URL: https://edoc.unibas.ch/84292/

Downloads: Statistics Overview


Stubborn sets are a pruning technique for state-space search which is well established in optimal classical planning. In this paper, we show that weak stubborn sets introduced in recent work in planning are actually not weak stubborn sets in Valmari's original sense. Based on this finding, we introduce weak stubborn sets in the original sense for planning by providing a generalized definition analogously to generalized strong stubborn sets in previous work. We discuss the relationship of strong, weak and the previously called weak stubborn sets, thus providing a further step in getting an overall picture of the stubborn set approach in planning.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Sievers, Silvan
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:International Joint Conferences on Artificial Intelligence
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
Identification Number:
edoc DOI:
Last Modified:30 Aug 2021 08:27
Deposited On:30 Aug 2021 08:27

Repository Staff Only: item control page