Publications

Scientific works and publications


See also: Google ScholarORCID


BibBase schreiber, d
generated by bibbase.org
  2024 (10)
Engineering Optimal Parallel Task Scheduling. Akram, M., Maas, N., Sanders, P., & Schreiber, D. 2024.
Engineering Optimal Parallel Task Scheduling [link] arxiv   Engineering Optimal Parallel Task Scheduling [pdf] pdf   link   bibtex  
The 2023 International Planning Competition. Taitler, A., Alford, R., Espasa, J., Behnke, G., Fiser, D., Gimelfarb, M., Pommerening, F., Sanner, S., Scala, E., Schreiber, D., Segovia-aguas, J., & Seipp, J. AI Magazine. 2024.
The 2023 International Planning Competition [pdf] pdf   doi   link   bibtex   1 download  
Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024). Bercher, P., Schreiber, D., Ondrčková, S., & Alford, R., editors. 2024.
Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024) [link] website   Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024) [pdf] pdf   link   bibtex   1 download  
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines. Akram, M., & Schreiber, D. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 137–139, 2024.
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines [pdf] pdf   Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines [pdf] slides   doi   link   bibtex   2 downloads  
MallobSat: Scalable SAT Solving by Clause Sharing. Schreiber, D., & Sanders, P. 2024. Journal of Artificial Intelligence Research (JAIR), in press; to be presented at Pragmatics of SAT (PoS) '24
MallobSat: Scalable SAT Solving by Clause Sharing [pdf] pdf   link   bibtex   1 download  
Trusted Scalable SAT Solving with on-the-fly LRAT Checking. Schreiber, D. 2024. Int. Conf. on Theory and Applications of Satisfiability Testing (SAT), in press
Trusted Scalable SAT Solving with on-the-fly LRAT Checking [pdf] pdf   doi   link   bibtex  
Scalable SAT Solving on Demand (Abstract). Schreiber, D., & Sanders, P. 2024. Highlights of Parallel Computing (HOPC), in press
Scalable SAT Solving on Demand (Abstract) [pdf] pdf   Scalable SAT Solving on Demand (Abstract) [pdf] slides   Scalable SAT Solving on Demand (Abstract) [pdf] poster   doi   link   bibtex  
MallobSat and MallobSat-ImpCheck in the SAT Competition 2024. Schreiber, D. 2024. International SAT Competition 2024: Solver and Benchmark Descriptions, to appear
MallobSat and MallobSat-ImpCheck in the SAT Competition 2024 [pdf] pdf   link   bibtex  
Optimal Parallel Task Scheduling via SAT. Akram, M., & Schreiber, D. 2024. International SAT Competition 2024: Solver and Benchmark Descriptions, to appear
Optimal Parallel Task Scheduling via SAT [pdf] pdf   link   bibtex  
An Empirical Study on Learned Clause Overlaps in Distributed SAT Solving. Borowitz, J., Schreiber, D., & Sanders, P. 2024. Pragmatics of SAT (PoS), to appear
An Empirical Study on Learned Clause Overlaps in Distributed SAT Solving [pdf] pdf   link   bibtex  
  2023 (3)
Scalable SAT Solving and its Application. Schreiber, D. Ph.D. Thesis, Karlsruhe Institute of Technology (KIT), 2023.
Scalable SAT Solving and its Application [pdf] pdf   Scalable SAT Solving and its Application [pdf] slides   doi   link   bibtex   1 download  
Unsatisfiability proofs for distributed clause-sharing SAT solvers. Michaelson, D., Schreiber, D., Heule, M. J. H., Kiesl-Reiter, B., & Whalen, M. W. In Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 348–366, 2023. Springer (Nominated for a best paper award)
Unsatisfiability proofs for distributed clause-sharing SAT solvers [pdf] pdf   Unsatisfiability proofs for distributed clause-sharing SAT solvers [pdf] slides   doi   link   bibtex  
Mallob(32,64,1600) in the SAT Competition 2023. Schreiber, D. In International SAT Competition: Benchmark and Solver Descriptions, pages 46–47, 2023.
Mallob(32,64,1600) in the SAT Competition 2023 [pdf] pdf   link   bibtex  
  2022 (4)
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. Sanders, P., & Schreiber, D. Journal of Open Source Software (JOSS), 7(76): 4591. 2022.
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling [pdf] pdf   doi   link   bibtex  
Decentralized online scheduling of malleable NP-hard jobs. Sanders, P., & Schreiber, D. In Int. European Conf. on Parallel Processing (Euro-Par), pages 119–135, 2022. Springer (Nominated for a best paper award)
Decentralized online scheduling of malleable NP-hard jobs [pdf] pdf   Decentralized online scheduling of malleable NP-hard jobs [pdf] slides   doi   link   bibtex  
Mallob in the SAT Competition 2022. Schreiber, D. In International SAT Competition: Benchmark and Solver Descriptions, pages 46–47, 2022.
Mallob in the SAT Competition 2022 [pdf] pdf   link   bibtex  
(poster only) Scalable Satisfiability-based Problem Solving. Schreiber, D., & Sanders, P. 2022. Helmholtz AI Conference
(poster only) Scalable Satisfiability-based Problem Solving [pdf] poster   link   bibtex   1 download  
  2021 (6)
Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning. Schreiber, D. Journal of Artificial Intelligence Research (JAIR), 70: 1117–1181. 2021. Presented at International Joint Conference of Artificial Intelligence (IJCAI), 2021
Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning [pdf] pdf   Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning [pdf] slides   Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning [pdf] poster   Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning [link] video   doi   link   bibtex  
Scalable SAT Solving in the Cloud. Schreiber, D., & Sanders, P. In Int. Conf. on Theory and Applications of Satisfiability Testing (SAT), pages 518–534, 2021. Springer
Scalable SAT Solving in the Cloud [pdf] pdf   Scalable SAT Solving in the Cloud [pdf] slides   Scalable SAT Solving in the Cloud [link] video   doi   link   bibtex  
Scalable discrete algorithms for big data applications. Hespe, D., Hübner, L., Hübschle-Schneider, L., Sanders, P., & Schreiber, D. In Int. Conf. on High Performance Computing in Science and Engineering, pages 439–449, 2021. Springer
Scalable discrete algorithms for big data applications [pdf] slides   doi   link   bibtex  
Mallob in the SAT Competition 2021. Schreiber, D. In Proceedings of International SAT Competition: Solver and Benchmark Descriptions, pages 38–39, 2021.
Mallob in the SAT Competition 2021 [pdf] pdf   link   bibtex  
The ``Factories'' HTN Domain. Sönnichsen, M., & Schreiber, D. In Proc. International Planning Competition, pages 45–46, 2021.
The ``Factories'' HTN Domain [pdf] pdf   link   bibtex  
Lifted logic for task networks: TOHTN planner Lilotane in the IPC 2020. Schreiber, D. In Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 9–12, 2021.
Lifted logic for task networks: TOHTN planner Lilotane in the IPC 2020 [pdf] pdf   link   bibtex   21 downloads  
  2020 (1)
Engineering HordeSat towards malleability: mallob-mono in the SAT 2020 cloud track. Schreiber, D. In International SAT Competition: Benchmark and Solver Descriptions, pages 45–46, 2020.
Engineering HordeSat towards malleability: mallob-mono in the SAT 2020 cloud track [pdf] pdf   link   bibtex  
  2019 (4)
Tree-REX: SAT-based tree exploration for efficient and high-quality HTN planning. Schreiber, D., Pellier, D., Fiorino, H., & Balyo, T. In Int. Conf. on Automated Planning and Scheduling (ICAPS), pages 382–390, 2019.
Tree-REX: SAT-based tree exploration for efficient and high-quality HTN planning [pdf] pdf   Tree-REX: SAT-based tree exploration for efficient and high-quality HTN planning [pdf] slides   doi   link   bibtex  
Efficient SAT Encodings for Hierarchical Planning. Schreiber, D., Pellier, D., Fiorino, H., & Balyo, T. In Int. Conf. on Agents and Artificial Intelligence (ICAART), volume 2, pages 531–538, 2019.
Efficient SAT Encodings for Hierarchical Planning [pdf] pdf   Efficient SAT Encodings for Hierarchical Planning [pdf] slides   doi   link   bibtex  
PASAR—Planning as Satisfiability with Abstraction Refinement. Froleyks, N., Balyo, T., & Schreiber, D. In Symposium on Combinatorial Search (SoCS), volume 10, pages 70–78, 2019.
PASAR—Planning as Satisfiability with Abstraction Refinement [link]Paper   PASAR—Planning as Satisfiability with Abstraction Refinement [pdf] pdf   link   bibtex  
PASAR Entering the Sparkle Planning Challenge 2019. Froleyks, N., Balyo, T., & Schreiber, D. In Proc. Sparkle Planning Challenge, 2019.
PASAR Entering the Sparkle Planning Challenge 2019 [pdf] pdf   link   bibtex  
  2018 (1)
Hierarchical task network planning using SAT techniques. Schreiber, D. Master's thesis, Grenoble Institut National Polytechnique (INP) and Karlsruhe Institute of Technology (KIT), 2018.
Hierarchical task network planning using SAT techniques [pdf] pdf   Hierarchical task network planning using SAT techniques [pdf] slides   doi   link   bibtex  
  2016 (1)
Energieeffiziente Ausführung von qualitätsbewussten Algorithmen für Mobile Simulationen. Schreiber, D. Bachelor's thesis, Universität Stuttgart, 2016.
Energieeffiziente Ausführung von qualitätsbewussten Algorithmen für Mobile Simulationen [pdf] pdf   Energieeffiziente Ausführung von qualitätsbewussten Algorithmen für Mobile Simulationen [pdf] slides   link   bibtex