default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Ståhlberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Simon Ståhlberg, Blai Bonet, Hector Geffner:
Learning General Policies for Classical Planning Domains: Getting Beyond C2. CoRR abs/2403.11734 (2024)- [i4]Dominik Drexler, Simon Ståhlberg, Blai Bonet, Hector Geffner:
Symmetries and Expressive Requirements for Learning General Policies. CoRR abs/2409.15892 (2024) - [i3]Martin Funkquist, Simon Ståhlberg, Hector Geffner:
Learning to Ground Existentially Quantified Goals. CoRR abs/2409.20259 (2024) - 2023
- [c9]Simon Ståhlberg:
Lifted Successor Generation by Maximum Clique Enumeration. ECAI 2023: 2194-2201 - [c8]Simon Ståhlberg, Blai Bonet, Hector Geffner:
Learning General Policies with Policy Gradient Methods. KR 2023: 647-657 - 2022
- [c7]Simon Ståhlberg, Blai Bonet, Hector Geffner:
Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits. ICAPS 2022: 629-637 - [c6]Simon Ståhlberg, Blai Bonet, Hector Geffner:
Learning Generalized Policies without Supervision Using GNNs. KR 2022 - [i2]Simon Ståhlberg, Blai Bonet, Hector Geffner:
Learning Generalized Policies Without Supervision Using GNNs. CoRR abs/2205.06002 (2022) - 2021
- [c5]Simon Ståhlberg, Guillem Francès, Jendrik Seipp:
Learning Generalized Unsolvability Heuristics for Classical Planning. IJCAI 2021: 4175-4181 - [i1]Simon Ståhlberg, Blai Bonet, Hector Geffner:
Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits. CoRR abs/2109.10129 (2021)
2010 – 2019
- 2017
- [b1]Simon Ståhlberg
:
Methods for Detecting Unsolvable Planning Instances using Variable Projection. Linköping University, Sweden, 2017 - [c4]Simon Ståhlberg:
Tailoring Pattern Databases for Unsolvable Planning Instances. ICAPS 2017: 274-282 - 2016
- [j1]Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg:
Refining complexity analyses in planning by exploiting the exponential time hypothesis. Ann. Math. Artif. Intell. 78(2): 157-175 (2016) - [c3]Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg:
Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. ECAI 2016: 184-192 - 2015
- [c2]Meysam Aghighi, Peter Jonsson, Simon Ståhlberg:
Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. AAAI 2015: 3225-3231 - 2013
- [c1]Christer Bäckström, Peter Jonsson, Simon Ståhlberg:
Fast Detection of Unsolvable Planning Instances Using Local Consistency. SOCS 2013: 29-37
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
