Simon Ståhlberg

Orcid: 0000-0002-4092-8175

According to our database1, Simon Ståhlberg authored at least 23 papers between 2013 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Efficient Lookahead Encoding and Abstracted Width for Learning General Policies in Classical Planning.
CoRR, May, 2026

First-Order Representation Languages for Goal-Conditioned RL.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Code and Data for the AAAI 2026 paper "First-Order Representation Languages for Goal-Conditioned RL".
Dataset, November, 2025

Learning More Expressive General Policies for Classical Planning Domains.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
Code, Data and Models for the AAAI 2025 paper "Learning More Expressive General Policies for Classical Planning Domains".
Dataset, December, 2024

Code and Data for the Paper titled "Symmetries and Expressive Requirements for Learning General Policies".
Dataset, August, 2024

Learning General Policies for Classical Planning Domains: Getting Beyond C<sub>2</sub>.
CoRR, 2024

Learning to Ground Existentially Quantified Goals.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Symmetries and Expressive Requirements for Learning General Policies.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

2023
Code and Data for the KR 2023 paper "Learning General Policies with Policy Gradient Methods".
Dataset, June, 2023

Learning General Policies with Policy Gradient Methods.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Lifted Successor Generation by Maximum Clique Enumeration.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Code and Data for the KR 2022 paper "Learning Generalized Policies Without Supervision Using GNNs".
Dataset, May, 2022

Code and Data for the ICAPS 2022 paper "Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits".
Dataset, March, 2022

Learning Generalized Policies without Supervision Using GNNs.
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.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
Learning Generalized Unsolvability Heuristics for Classical Planning.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2017
Methods for Detecting Unsolvable Planning Instances using Variable Projection.
PhD thesis, 2017

Tailoring Pattern Databases for Unsolvable Planning Instances.
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.
Ann. Math. Artif. Intell., 2016

Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis.
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.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013
Fast Detection of Unsolvable Planning Instances Using Local Consistency.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013


  Loading...