Simon Ståhlberg

According to our database, Simon Ståhlberg authored at least 14 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Learning to Ground Existentially Quantified Goals.

Martin Funkquist, Simon Ståhlberg, Hector Geffner

CoRR, 2024

Symmetries and Expressive Requirements for Learning General Policies.

Dominik Drexler, Simon Ståhlberg, Blai Bonet, Hector Geffner

CoRR, 2024

Learning General Policies for Classical Planning Domains: Getting Beyond C₂.

Simon Ståhlberg, Blai Bonet, Hector Geffner

CoRR, 2024

2023

Learning General Policies with Policy Gradient Methods.

Simon Ståhlberg, Blai Bonet, Hector Geffner

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Lifted Successor Generation by Maximum Clique Enumeration.

Simon Ståhlberg

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Learning Generalized Policies without Supervision Using GNNs.

Simon Ståhlberg, Blai Bonet, Hector Geffner

Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits.

Simon Ståhlberg, Blai Bonet, Hector Geffner

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

Learning Generalized Unsolvability Heuristics for Classical Planning.

Simon Ståhlberg, Guillem Francès, Jendrik Seipp

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2017

Methods for Detecting Unsolvable Planning Instances using Variable Projection.

Simon Ståhlberg

PhD thesis, 2017

Tailoring Pattern Databases for Unsolvable Planning Instances.

Simon Ståhlberg

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

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

Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis.

Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs.

Meysam Aghighi, Peter Jonsson, Simon Ståhlberg

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013

Fast Detection of Unsolvable Planning Instances Using Local Consistency.

Christer Bäckström, Peter Jonsson, Simon Ståhlberg

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013