| Fast detection of unsolvable planning instances using local consistency C Bäckström, P Jonsson, S Ståhlberg Proceedings of the International Symposium on Combinatorial Search 4 (1), 29-37, 2013 | 51 | 2013 |
| Learning general optimal policies with graph neural networks: Expressive power, transparency, and limits S Ståhlberg, B Bonet, H Geffner Proceedings of the International Conference on Automated Planning and …, 2022 | 40 | 2022 |
| Learning generalized policies without supervision using gnns S Ståhlberg, B Bonet, H Geffner arXiv preprint arXiv:2205.06002, 2022 | 26 | 2022 |
| Learning generalized unsolvability heuristics for classical planning S Ståhlberg, G Francès, J Seipp International Joint Conference on Artificial Intelligence, 19th-27th August …, 2021 | 18 | 2021 |
| Learning general policies with policy gradient methods S Ståhlberg, B Bonet, H Geffner Proceedings of the International Conference on Principles of Knowledge …, 2023 | 11 | 2023 |
| Tractable cost-optimal planning over restricted polytree causal graphs M Aghighi, P Jonsson, S Ståhlberg Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 10 | 2015 |
| Methods for Detecting Unsolvable Planning Instances using Variable Projection S Ståhlberg Linköping University Electronic Press, 2017 | 5 | 2017 |
| Refining complexity analyses in planning by exploiting the exponential time hypothesis M Aghighi, C Bäckström, P Jonsson, S Ståhlberg Annals of Mathematics and Artificial Intelligence 78, 157-175, 2016 | 5 | 2016 |
| Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. M Aghighi, C Bäckström, P Jonsson, S Ståhlberg ECAI, 184-192, 2016 | 4 | 2016 |
| Tailoring pattern databases for unsolvable planning instances S Ståhlberg Proceedings of the International Conference on Automated Planning and …, 2017 | 3 | 2017 |
| Lifted successor generation by maximum clique enumeration S Ståhlberg Proc. ECAI, 2194-2201, 2023 | 2 | 2023 |
| Learning General Policies for Classical Planning Domains: Getting Beyond C S Ståhlberg, B Bonet, H Geffner arXiv preprint arXiv:2403.11734, 2024 | | 2024 |
| Identifying Unsolvable Instances, Forbidden States and Irrelevant Information in Planning S Ståhlberg | | 2012 |
