{"type":"ScholarlyArticle","title":"On Weak Stubborn Sets in Classical Planning","authors":[{"name":"Silvan Sievers","slug":"silvan-sievers","given":"Silvan","family":"Sievers","affiliation":""},{"name":"Martin Wehrle","slug":"martin-wehrle","given":"Martin","family":"Wehrle","affiliation":""}],"abstract":"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.","doi":"10.24963/ijcai.2021/573","url":"https://ijcai.org/proceedings/2021/573","pdf":"https://ijcai.org/proceedings/2021/0573.pdf","markdown":"https://ijcai.org/proceedings/2021/573.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/573","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Planning and Scheduling","track":"Main Track","number":573,"pages":{"first":4167,"last":4174},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Search in Planning and Scheduling"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}