default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilvan Sievers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Thorsten Klößner, Álvaro Torralba, Marcel Steinmetz, Silvan Sievers:
Merge-and-Shrink Heuristics for SSPs with Prune Transformations. ECAI 2024: 1222-1229- [c30]Silvan Sievers, Thomas Keller, Gabriele Röger:
Merging or Computing Saturated Cost Partitionings? A Merge Strategy for the Merge-and-Shrink Framework. ICAPS 2024: 541-545 - 2023
- [c29]Daniel Gnad, Silvan Sievers, Álvaro Torralba
:
Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases. ICAPS 2023: 138-147 - [c28]Thorsten Klößner, Álvaro Torralba, Marcel Steinmetz, Silvan Sievers:
A Theory of Merge-and-Shrink for Stochastic Shortest Path Problems. ICAPS 2023: 203-211 - [c27]Raphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert:
Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement. ICAPS 2023: 221-226 - [c26]Remo Christen, Salomé Eriksson, Michael Katz, Christian Muise, Alice Petrov, Florian Pommerening, Jendrik Seipp, Silvan Sievers, David Speck:
PARIS: Planning Algorithms for Reconfiguring Independent Sets. ECAI 2023: 453-460 - 2022
- [c25]Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa:
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond. ICAPS 2022: 124-133 - [c24]Silvan Sievers, Daniel Gnad, Álvaro Torralba:
Additive Pattern Databases for Decoupled Search. SOCS 2022: 180-189 - 2021
- [j1]Silvan Sievers, Malte Helmert:
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems. J. Artif. Intell. Res. 71: 781-883 (2021) - [c23]Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert:
Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS 2021: 271-280 - [c22]Álvaro Torralba, Jendrik Seipp, Silvan Sievers:
Automatic Instance Generation for Classical Planning. ICAPS 2021: 376-384 - [c21]Silvan Sievers, Martin Wehrle:
On Weak Stubborn Sets in Classical Planning. IJCAI 2021: 4167-4174 - 2020
- [c20]Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert:
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. IJCAI 2020: 4152-4160 - [c19]Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers:
An Atom-Centric Perspective on Stubborn Sets. SOCS 2020: 57-65
2010 – 2019
- 2019
- [c18]Silvan Sievers, Michael Katz, Shirin Sohrabi, Horst Samulowitz, Patrick Ferber:
Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection. AAAI 2019: 7715-7723 - [c17]Alexander Rovner, Silvan Sievers, Malte Helmert:
Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. ICAPS 2019: 362-367 - [c16]Silvan Sievers, Gabriele Röger, Martin Wehrle, Michael Katz:
Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks. ICAPS 2019: 446-454 - [c15]Álvaro Torralba, Silvan Sievers:
Merge-and-Shrink Task Reformulation for Classical Planning. IJCAI 2019: 5644-5652 - 2018
- [c14]Gabriele Röger, Silvan Sievers, Michael Katz:
Symmetry-Based Task Reduction for Relaxed Reachability Analysis. ICAPS 2018: 208-217 - [c13]Silvan Sievers:
Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions. SOCS 2018: 90-98 - 2017
- [c12]Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz:
Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS 2017: 91-99 - 2016
- [c11]Silvan Sievers, Martin Wehrle, Malte Helmert:
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics. ICAPS 2016: 294-298 - [c10]Martin Wehrle, Silvan Sievers, Malte Helmert:
Graph-Based Factorization of Classical Planning Problems. IJCAI 2016: 3286-3292 - 2015
- [c9]Jendrik Seipp, Silvan Sievers, Malte Helmert, Frank Hutter:
Automatic Configuration of Sequential Planning Portfolios. AAAI 2015: 3364-3370 - [c8]Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers, Martin Wehrle:
Heuristics and Symmetries in Classical Planning. AAAI 2015: 3371-3377 - [c7]Silvan Sievers, Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz:
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI 2015: 3378-3385 - [c6]Malte Helmert, Gabriele Röger, Silvan Sievers:
On the Expressive Power of Non-Linear Merge-and-Shrink Representations. ICAPS 2015: 106-114 - [c5]Silvan Sievers, Malte Helmert:
A Doppelkopf Player Based on UCT. KI 2015: 151-165 - [c4]Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz:
An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search. KI 2015: 166-180 - 2014
- [c3]Silvan Sievers, Martin Wehrle, Malte Helmert:
Generalized Label Reduction for Merge-and-Shrink Heuristics. AAAI 2014: 2358-2366 - [c2]Silvan Sievers, Martin Wehrle, Malte Helmert:
Bounded Intention Planning Revisited. ECAI 2014: 1097-1098 - 2012
- [c1]Silvan Sievers, Manuela Ortlieb, Malte Helmert:
Efficient Implementation of Pattern Database Heuristics for Classical Planning. SOCS 2012: 49-56
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 2025-01-20 23:05 CET 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:
