publications
publications by categories in reversed chronological order.
2025
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric PlanningIn Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2025), 2025
- Counting and Reasoning with PlansIn Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2025), 2025
2024
- Cost Partitioning for Multiple Sequence AlignmentIn Proceedings of the 27th European Conference on Artificial Intelligence (ECAI 2024), 2024
- Decoupled Search for the Masses: A Novel Task Transformation for Classical PlanningIn Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024
- Appendix, Code, and Experimental Data of the ICAPS 2024 paper “Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning”2024
2023
- RagnarokIn Tenth International Planning Competition (IPC-10): Planner Abstracts, 2023
- DiSCO: Decoupled Search + COnjunctionsIn Tenth International Planning Competition (IPC-10): Planner Abstracts, 2023
- Planning over Integers: Compilations and UndecidabilityIn Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023
- Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern DatabasesIn Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023
- DecAbStarIn Tenth International Planning Competition (IPC-10): Planner Abstracts, 2023
- DecStar-2023In Tenth International Planning Competition (IPC-10): Planner Abstracts, 2023
- Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases – Supplementary Material2023
- Structurally Restricted Fragments of Numeric Planning – A Complexity AnalysisIn Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2023), 2023
- Finding Matrix Multiplication Algorithms with Classical PlanningIn Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023
- Finding Matrix Multiplication Algorithms with Classical Planning — Extended AbstractIn The 35th Annual Workshop of the Swedish Artificial Intelligence Society (SAIS), 2023
- Code and data for the ICAPS 2023 paper “Finding Matrix Multiplication Algorithms with Classical Planning”2023
- GOFAIIn Learning Track of the International Planning Competition 2023: Planner Abstracts, 2023
2022
- Beyond Stars - Generalized Topologies for Decoupled SearchIn Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022), 2022
- Additive Pattern Databases for Decoupled SearchIn Proceedings of the 15th Annual Symposium on Combinatorial Search (SoCS 2022), 2022
- Additive Pattern Databases for Decoupled Search: Additional Material2022
- Code, benchmarks and experiment data for the SoCS 2022 paper “Additive Pattern Databases for Decoupled Search”2022
2021
- Custom-Design of FDR Encodings: The Case of Red-Black PlanningIn Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), 2021
- Revisiting Dominance Pruning in Decoupled SearchIn Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021), 2021
- Model Checking omega-Regular Properties with Decoupled SearchIn Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II, 2021
- Star-Topology Decoupled State-Space Search in AI Planning and Model CheckingSaarland University, 2021
2020
- PlanenIn Handbuch der Künstlichen Intelligenz, 2020
2019
- Learning How to Ground a Plan – Partial Grounding in Classical PlanningIn Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI 2019), 2019
- Strong Stubborn Set Pruning for Star-Topology Decoupled State Space SearchJournal of Artificial Intelligence Research, 2019
- IPALAMA - Planner AbstractIn Sparkle Planning Challenge: Planner Abstracts, 2019
- On the Relation between Star-Topology Decoupling and Petri Net UnfoldingIn Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019
- Advanced Factoring Strategies for Decoupled Search Using Linear ProgrammingIn Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019
2018
- Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space SearchIn Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), 2018
- SaarPlan: Combining Saarland’s Greatest Planning TechniquesIn Ninth International Planning Competition (IPC-9): Planner Abstracts, 2018
- DecStar – STAR-topology DECoupled Search at its bestIn Ninth International Planning Competition (IPC-9): Planner Abstracts, 2018
- Star-Topology Decoupling in SPINIn Model Checking Software - 25th International Symposium, SPIN 2018, Malaga, Spain, June 20-22, 2018, Proceedings, 2018
- Star-Topology Decoupled State Space SearchArtificial Intelligence, 2018
2017
- Symmetry Breaking in Star-Topology Decoupled SearchIn Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), 2017
- Beyond Forks: Finding and Ranking Star Factorings for Decoupled SearchIn Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), 2017
- Symbolic Leaf Representation in Decoupled SearchIn Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017), 2017
- Beyond Red-Black Planning: Limited-Memory State VariablesIn Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), 2017
2016
- Decoupled Strong Stubborn SetsIn Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 2016
- Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its ApplicationsIn Proceedings of the Ninth Annual Symposium on Combinatorial Search (SoCS 2016), 2016
- Decoupled Strong Stubborn Sets (Technical Report)2016Available at \urlhttp://fai.cs.uni-saarland.de/hoffmann/papers/ijcai16a-tr.pdf
- Decoupled Search for Proving UnsolvabilityIn Unsolvability International Planning Competition: Planner Abstracts, 2016
- Django: Unchaining the Power of Red-Black PlanningIn Unsolvability International Planning Competition: Planner Abstracts, 2016
- On State-Dominance Criteria in Fork-Decoupled SearchIn Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 2016
2015
- From Fork Decoupling to Star-Topology DecouplingIn Proceedings of the Eighth Annual Symposium on Combinatorial Search (SoCS 2015), 2015
- Beating LM-Cut with hmax (Sometimes): Fork-Decoupled State Space SearchIn Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling (ICAPS 2015), 2015
- Red-Black Planning: A New Tractability Analysis and Heuristic FunctionIn Proceedings of the Eighth Annual Symposium on Combinatorial Search (SoCS 2015), 2015