Home | deutsch  | Legals | Data Protection | Sitemap | KIT
Mitarbeiterbild Dominik Schreiber

M.Sc. Dominik Schreiber
Room: 209
Phone: +49 721 608-45267
Fax: +49 721 608-43088
dominik schreiberYbx7∂kit edu

Curriculum Vitae

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

  • HTN-SAT: Totally-ordered, quality-aware HTN planning system using incremental SAT solving
  • Aquaplanning: Automated Planning framework for educative and research purposes

Publications


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, Menlo Park, CA
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, Menlo Park, CA
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, Palo Alto, CA
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, Setúbal, P. doi:10.5220/0007343305310538 Volltext Volltext der Publikation als PDF-Dokument
27: Algorithmen II, Vorlesung, WS 2018/19, 28.01.2019.
Schreiber, D.; Lamm, S.; Schlag, S.; Maier, T.; KIT | Webcast [Hrsg.].
2019. doi:10.5445/DIVA/2019-100
Hierarchical Task Network Planning Using SAT Techniques. Masterarbeit.
Schreiber, D. P.
2018. KIT, Karlsruhe. doi:10.5445/IR/1000104165 Volltext Volltext der Publikation als PDF-Dokument
Technical Reports
Title Author(s) Source Date
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


Talks
Title Location Date
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


Teaching

Courses
Title Type Semester
Parallele Algorithmen Vorlesung (V) WS 18/19
Automated Planning and Scheduling WS 18/19


Open Theses
Title Subject Supervisor
Malleable Cube&Conquer SAT Solving Parallel and distributed algorithms, SAT Solving

Dominik Schreiber


Supervised Theses
Title Subject Supervisor Student
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

Dominik Schreiber

Jens Manig