Fast Detection of Unsolvable Planning Instances Using Local Consistency. - Christer Bäckström; Peter Jonsson; Simon Ståhlberg (SOCS, 2013)

Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. - Meysam Aghighi; Peter Jonsson; Simon Ståhlberg (AAAI, 2015)

Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. - Meysam Aghighi; Christer Bäckström; Peter Jonsson; Simon Ståhlberg (ECAI, 2016)

Refining complexity analyses in planning by exploiting the exponential time hypothesis. - Meysam Aghighi; Christer Bäckström; Peter Jonsson; Simon Ståhlberg (Ann. Math. Artif. Intell., 2016)

Tailoring Pattern Databases for Unsolvable Planning Instances. - Simon Ståhlberg (ICAPS, 2017)

Methods for Detecting Unsolvable Planning Instances using Variable Projection. - Simon Ståhlberg (2017)

Learning Generalized Unsolvability Heuristics for Classical Planning. - Simon Ståhlberg; Guillem Francès; Jendrik Seipp (IJCAI, 2021)

Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits. - Simon Ståhlberg; Blai Bonet; Hector Geffner (ICAPS, 2022)

Learning Generalized Policies without Supervision Using GNNs. - Simon Ståhlberg; Blai Bonet; Hector Geffner (KR, 2022)

Lifted Successor Generation by Maximum Clique Enumeration. - Simon Ståhlberg (ECAI, 2023)

Learning General Policies with Policy Gradient Methods. - Simon Ståhlberg; Blai Bonet; Hector Geffner (KR, 2023)

Symmetries and Expressive Requirements for Learning General Policies. - Dominik Drexler; Simon Ståhlberg; Blai Bonet; Hector Geffner (KR, 2024)

Learning to Ground Existentially Quantified Goals. - Martin Funkquist; Simon Ståhlberg; Hector Geffner (KR, 2024)

Learning General Policies for Classical Planning Domains: Getting Beyond C2. - Simon Ståhlberg; Blai Bonet; Hector Geffner (CoRR, 2024)

Learning More Expressive General Policies for Classical Planning Domains. - Simon Ståhlberg; Blai Bonet; Hector Geffner (AAAI, 2025)