M.Sc. Dominik Schreiber
- Room: 209
- Phone: +49 721 608-45267
- Fax: +49 721 608-43088
- dominik schreiber ∂does-not-exist.kit edu
- www.dominikschreiber.de
Curriculum Vitae
- Double-degree Master studies in Computer Science: Karlsruhe Institute of Technology (KIT), Germany and Grenoble Institut National Polytechnique (INP), France (2016-2018)
- Bachelor studies in Software Engineering (B.Sc.): University of Stuttgart, Germany (2013-2016)
For more details, please consult my private homepage.
Research Interests
- Malleable load balancing strategies in the context of NP-hard computations
- Satisfiability (SAT) solving and its efficient practical usage
- Automated planning, in particular hierarchical planning and SAT-based planning
Software
- Mallob (Malleable Load Balancer / Massively Parallel Logic Backend): Platform for massively parallel and distributed computations, focusing on SAT solving on-demand.
- International SAT Competitions: 1st Place in Cloud Tracks (1600 hardware threads) 2020-2022, further top placings in Parallel Tracks (64 hardware threads) 2021-2022. — press article 2020, website of SAT Competitions
- Nominated for Best Paper Award @ 28th International European Conference on Parallel and Distributed Computing (Euro-Par) 2022
- Lilotane (Lifted Logic for Task Networks): Automated planner for hierarchical planning problems using an advanced encoding into SAT. 2nd place in Total Order Track of International Planning Competition 2020.
- HTN-SAT (Hierarchical Task Networks via SATisfiability): Totally-ordered, quality-aware HTN planning system using incremental SAT solving; predecessor of Lilotane.
| Title | Author(s) | Source | Date |
|---|---|---|---|
| Mallob in the SAT Competition 2022 | Dominik Schreiber |
SAT Competition 2022, Cloud & Parallel Track |
2022 |
| Mallob in the SAT Competition 2021 | Dominik Schreiber |
SAT Competition 2021, Cloud & Parallel Track |
2021 |
| The HTN Domain "Factories" | Malte Sönnichsen, Dominik Schreiber |
Proceedings of 10th International Planning Competition: Planner and Domain Abstracts |
2021 |
| Lifted Logic for Task Networks: TOHTN Planner Lilotane in the IPC 2020 | Dominik Schreiber |
Proceedings of 10th International Planning Competition: Planner and Domain Abstracts |
2021 |
| Engineering HordeSat Towards Malleability: mallob-mono in the SAT 2020 Cloud Track | Dominik Schreiber |
SAT Competition 2020, Cloud Track |
2020 |
| PASAR Entering the Sparkle Planning Challenge 2019 | Nils Froleyks, Tomas Balyo, Dominik Schreiber |
Technical Report, Sparkle Planning Challenge 2019 |
July 2019 |
| Aquaplanning: An Educational Framework for Automated Planning | Tomas Balyo, Dominik Schreiber, Patrick Hegemann, Jeremias Trautmann |
Technical Report, Sparkle Planning Challenge 2019 |
July 2019 |
| Title | Location | Date |
|---|---|---|
| Decentralized Online Scheduling of Malleable NP-hard Jobs | Glasgow, UK |
August 2022 |
| Scalable Satisfiability-driven Problem Solving | Dresden |
Juni 2022 |
| Lilotane: A Lifted SAT-based Approach to Hierarchical Planning | Montreal-themed Virtual Reality |
August 2021 |
| Scalable SAT Solving in the Cloud | Barcelona, ES |
July 2021 |
| Finding Optimal Longest Paths by Dynamic Programming in Parallel | Napa, CA, USA |
July 2019 |
| Tree-REX: SAT-based Tree Exploration for Efficient and High-Quality HTN Planning | Berkeley, CA, USA |
July 2019 |
| Efficient SAT Encodings for Hierarchical Planning | Prague, CZ |
February 2019 |
| Title | Type | Semester |
|---|---|---|
| Parallele Algorithmen | Vorlesung (V) | WS 18/19 |
| Automated Planning and Scheduling | WS 18/19 |
| Title | Subject | Supervisor |
|---|---|---|
| Scalable Resolution of NP-hard Problems | Parallel and distributed algorithms, SAT Solving, automated planning |
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Asynchronous Clause Exchange for Malleable SAT Solving | SAT Solving, Distributed Algorithms | Dominik Schreiber, Markus Iser |
Malte Sönnichsen |
| Engineering Optimal Solvers for Rubik's Cubes | Combinatorial search | Peter Sanders, Dominik Schreiber |
Tan Grumser |
| K-Means in a Malleable Distributed Environment | Distributed Algorithms | Dominik Schreiber |
Michael Dörr |
| Cube&Conquer-inspired Malleable Distributed SAT Solving | Distributed Algorithms, SAT Solving | Peter Sanders, Dominik Schreiber |
Maximilian Schick |
| Pruning Techniques for Lifted SAT Based Hierarchical Planning | Automated planning | Peter Sanders, Dominik Schreiber |
Nikolai Schnell |
| Partially Instantiated Representations for Automated Planning | Automated Planning, SAT Solving, Parallel Algorithms | Dominik Schreiber |
Marvin Williams |
| PASAR – Planning as Satisfiability with Abstraction Refinement | Automated Planning, SAT Solving, Heuristic Search | Tomáš Balyo, Dominik Schreiber |
Nils Froleyks |
| Cube&Conquer-inspired Techniques for Parallel Automated Planning | Automated Planning, Parallel Algorithms | Tomáš Balyo, Dominik Schreiber |
Jean-Pierre von der Heydt |
| Compression Techniques for SAT Formula Descriptions | SAT Solving, Compression | Jens Manig |