Mitarbeiterbild Dominik Schreiber

Dr. rer. nat. Dominik Schreiber

Curriculum Vitae

For more details, please consult my private homepage.

Research Interests

  • Scalable resolution of NP-hard problems
    • SAT solving
    • automated planning
    • scheduling
  • Parallel and distributed discrete algorithms (HPC, cloud)
  • Reliable and trustworthy approaches to parallel+distributed automated reasoning

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-2023, further top placings in Parallel Tracks (64 hardware threads) 2021-2023. — 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.

Publications


The 2023 International Planning Competition
Taitler, A.; Alford, R.; Espasa, J.; Behnke, G.; Fišer, D.; Gimelfarb, M.; Pommerening, F.; Sanner, S.; Scala, E.; Schreiber, D.; Segovia-Aguas, J.; Seipp, J.
2024. AI Magazine, 45 (2), 280–296. doi:10.1002/aaai.12169Full textFull text of the publication as PDF document
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines
Akram, M.; Schreiber, D.
2024. Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 36th ACM Symposium on Parallelism in Algorithms and Architectures (2024) Nantes, Frankreich, 17.06.2024–21.06.2024, 137–139, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660268
Scalable discrete algorithms for big data applications
Hespe, D.; Hübner, L.; Hübschle-Schneider, L.; Sanders, P.; Schreiber, D.
2023. High Performance Computing in Science and Engineering ’21 – Transactions of the High Performance Computing Center, Stuttgart (HLRS) 2021. Ed.: W. Nagel, 439–449, Springer International Publishing. doi:10.1007/978-3-031-17937-2_27
Scalable SAT Solving and its Application. PhD dissertation
Schreiber, D. P.
2023, December 5. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000165224Full textFull text of the publication as PDF document
Unsatisfiability proofs for distributed clause-sharing SAT solvers
Michaelson, D.; Schreiber, D.; Heule, M. J. H.; Kiesl-Reiter, B.; Whalen, M. W.
2023. Tools and Algorithms for the Construction and Analysis of Systems : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22–27, 2023, Proceedings, Part I. Ed. by Sriram Sankaranarayanan, 348–366, Springer Nature Switzerland. doi:10.1007/978-3-031-30823-9_18Full textFull text of the publication as PDF document
Decentralized Online Scheduling of Malleable NP-hard Jobs
Sanders, P.; Schreiber, D.
2022. Euro-Par 2022 : Parallel Processing. Hrsg.: J. Cano, 119–135, Springer International Publishing. doi:10.1007/978-3-031-12597-3_8Full textFull text of the publication as PDF document
Scalable SAT Solving in the Cloud
Schreiber, D.; Sanders, P.
2021. Theory and Applications of Satisfiability Testing – SAT 2021. Ed.: C.-M. Li, 518–534, Springer. doi:10.1007/978-3-030-80223-3_35Full textFull text of the publication as PDF document
Finding Optimal Longest Paths by Dynamic Programming in Parallel
Fieger, K.; Balyo, T.; Schulz, C.; Schreiber, D.
2019. Proceedings of the 12th Annual Symposium on Combinatorial Search (SoCs 2019), Napa, CA, July 16-17, 2019, 61–69, AAAI Press
PASAR - Planning as Satisfiability with Abstraction Refinement
Froleyks, N.; Balyo, T.; Schreiber, D.
2019. Proceedings of the 12th Annual Symposium on Combinatorial Search (SoCs 2019), Napa, CA, July 16-17, 2019, 70–78, AAAI Press
Tree-REX: SAT-based Tree Exploration for Efficient and High-Quality HTN Planning
Schreiber, D.; Pellier, D.; Fiorino, H.; Balyo, T.
2019. Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), Berkeley, CA, July 11-15, 2019, Ed.: J. Benton, 382–390, AAAI Press
Efficient SAT Encodings for Hierarchical Planning
Schreiber, D.; Pellier, D.; Fiorino, H.; Balyo, T.
2019. Proceedings of the 11th International Conference on Agents and Artificial Intelligence (ICAART 2019), Prague, CZ, February 19-21, 2019. Ed.: J. van den Herik. Vol. 2, 531–538, SciTePress. doi:10.5220/0007343305310538Full textFull text of the publication as PDF document
Hierarchical Task Network Planning Using SAT Techniques. master’s thesis
Schreiber, D. P.
2018. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000104165Full textFull text of the publication as PDF document
Technical Reports
Title Author(s) Source Date

Nils Froleyks, Tomas Balyo, Dominik Schreiber

Technical Report, Sparkle Planning Challenge 2019

July 2019

Tomas Balyo, Dominik Schreiber, Patrick Hegemann, Jeremias Trautmann

Technical Report, Sparkle Planning Challenge 2019

July 2019

Dominik Schreiber

SAT Competition 2023, Cloud & Parallel Track

2023

Dominik Schreiber

SAT Competition 2022, Cloud & Parallel Track

2022

Dominik Schreiber

SAT Competition 2021, Cloud & Parallel Track

2021

Dominik Schreiber

SAT Competition 2020, Cloud Track

2020

Dominik Schreiber

Proceedings of 10th International Planning Competition: Planner and Domain Abstracts

2021

Malte Sönnichsen, Dominik Schreiber

Proceedings of 10th International Planning Competition: Planner and Domain Abstracts

2021

Teaching

Hinweis: Die folgenden Listen sind nicht aktuell; stattdessen bitte direkt auf den Lehrveranstaltungs-Seiten der Arbeitsgruppe nachsehen.

Open Theses
Title Subject Supervisor
Parallel and distributed algorithms, SAT Solving, automated planning
Supervised Theses
Title Subject Supervisor Student
SAT Solving, Distributed Algorithms

Dominik Schreiber, Markus Iser

Malte Sönnichsen

Combinatorial search

Peter Sanders, Dominik Schreiber

Tan Grumser

Distributed Algorithms

Dominik Schreiber

Michael Dörr

Distributed Algorithms, SAT Solving

Peter Sanders, Dominik Schreiber

Maximilian Schick

Automated planning

Peter Sanders, Dominik Schreiber

Nikolai Schnell

Automated Planning, SAT Solving, Parallel Algorithms

Dominik Schreiber

Marvin Williams

Automated Planning, SAT Solving, Heuristic Search

Tomáš Balyo, Dominik Schreiber

Nils Froleyks

Automated Planning, Parallel Algorithms

Tomáš Balyo, Dominik Schreiber

Jean-Pierre von der Heydt

SAT Solving, Compression

Jens Manig