Simon Ståhlberg

22 papers A* 10A 2B 1Journal 8

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	First-Order Representation Languages for Goal-Conditioned RL. AAAI Simon Ståhlberg, Hector Geffner
2025	J	`jnl`	First-Order Representation Languages for Goal-Conditioned RL. CoRR Simon Ståhlberg, Hector Geffner
2025	J	`jnl`	Learning General Policies with Policy Gradient Methods. CoRR Simon Ståhlberg, Blai Bonet, Hector Geffner
2025	A*	`conf`	Learning More Expressive General Policies for Classical Planning Domains. AAAI Simon Ståhlberg, Blai Bonet, Hector Geffner
2024	J	`jnl`	Learning General Policies for Classical Planning Domains: Getting Beyond C CoRR Simon Ståhlberg, Blai Bonet, Hector Geffner
2024	A*	`conf`	Learning to Ground Existentially Quantified Goals. KR Martin Funkquist, Simon Ståhlberg, Hector Geffner
2024	J	`jnl`	Learning to Ground Existentially Quantified Goals. CoRR Martin Funkquist, Simon Ståhlberg, Hector Geffner
2024	A*	`conf`	Symmetries and Expressive Requirements for Learning General Policies. KR Dominik Drexler, Simon Ståhlberg, Blai Bonet, Hector Geffner
2024	J	`jnl`	Symmetries and Expressive Requirements for Learning General Policies. CoRR Dominik Drexler, Simon Ståhlberg, Blai Bonet, Hector Geffner
2023	A*	`conf`	Learning General Policies with Policy Gradient Methods. KR Simon Ståhlberg, Blai Bonet, Hector Geffner
2023	A	`conf`	Lifted Successor Generation by Maximum Clique Enumeration. ECAI Simon Ståhlberg
2022	A*	`conf`	Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits. ICAPS Simon Ståhlberg, Blai Bonet, Hector Geffner
2022	J	`jnl`	Learning Generalized Policies Without Supervision Using GNNs. CoRR Simon Ståhlberg, Blai Bonet, Hector Geffner
2022	A*	`conf`	Learning Generalized Policies without Supervision Using GNNs. KR Simon Ståhlberg, Blai Bonet, Hector Geffner
2021	J	`jnl`	Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits. CoRR Simon Ståhlberg, Blai Bonet, Hector Geffner
2021	A*	`conf`	Learning Generalized Unsolvability Heuristics for Classical Planning. IJCAI Simon Ståhlberg, Guillem Francès, Jendrik Seipp
2017	—	`—`	Methods for Detecting Unsolvable Planning Instances using Variable Projection. Simon Ståhlberg
2017	A*	`conf`	Tailoring Pattern Databases for Unsolvable Planning Instances. ICAPS Simon Ståhlberg
2016	A	`conf`	Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. ECAI Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
2016	J	`jnl`	Refining complexity analyses in planning by exploiting the exponential time hypothesis. Ann. Math. Artif. Intell. Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
2015	A*	`conf`	Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. AAAI Meysam Aghighi, Peter Jonsson, Simon Ståhlberg
2013	B	`conf`	Fast Detection of Unsolvable Planning Instances Using Local Consistency. SOCS Christer Bäckström, Peter Jonsson, Simon Ståhlberg