Publikationen

@misc{akram2024engineering,
      title={Engineering Optimal Parallel Task Scheduling}, 
      author={Akram, Matthew and Maas, Nikolai and Sanders, Peter and Schreiber, Dominik},
      year={2024},
      eprint={2405.15371},
      archivePrefix={arXiv},
      primaryClass={cs.DS},
      url_arxiv={https://arxiv.org/abs/2405.15371}, 
      url_PDF={https://dominikschreiber.de/papers/2024-arxiv-engineering.pdf}
}

@article{taitler2024international,
	title={The 2023 International Planning Competition},
	author={Taitler, Ayal and Alford, Ron and Espasa, Joan and Behnke, Gregor and Fiser, Daniel and Gimelfarb, Michael and Pommerening, Florian and Sanner, Scott and Scala, Enrico and Schreiber, Dominik and Segovia-aguas, Javier and Seipp, Jendrik},
	journal={AI Magazine},
	year={2024},
	doi={10.1002/aaai.12169},
	url_PDF={https://dominikschreiber.de/papers/2024-aimag-ipc.pdf},
}

@Proceedings{HPlan2024proceedings,
  editor          = {Bercher, Pascal and Schreiber, Dominik and Ondrčková, Simona and Alford, Ron},
  title           = {Proceedings of the 7th {ICAPS} Workshop on Hierarchical Planning ({HPlan} 2024)},
  year            = {2024},
  url_website     = {http://hplan2024.hierarchical-task.net},
  url_PDF = {https://icaps24.icaps-conference.org/program/workshops/hplan/HPlanProceedings-2024.pdf}
}

@inproceedings{akram2024new,
	author = {Akram, Matthew and Schreiber, Dominik},
	title = {Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines},
	year = {2024},
	doi = {10.1145/3626183.3660268},
	booktitle = {ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	pages = {137--139},
	url_PDF={https://dominikschreiber.de/papers/2024-spaa-pruning.pdf},
	url_Slides={https://dominikschreiber.de/slides/2024-spaa-pruning.pdf},
}

@unpublished{schreiber2024mallobsat,
	title={{MallobSat}: Scalable {SAT} Solving by Clause Sharing},
	author={Schreiber, Dominik and Sanders, Peter},
	note={{Journal of Artificial Intelligence Research (JAIR)}, in press; to be presented at Pragmatics of SAT (PoS) '24},
	year={2024},
	url_PDF={https://dominikschreiber.de/papers/2024-jair-mallobsat-pre.pdf},
}

@unpublished{schreiber2024trusted,
	title={Trusted Scalable {SAT} Solving with on-the-fly {LRAT} Checking},
	author={Schreiber, Dominik},
	note={{Int. Conf. on Theory and Applications of Satisfiability Testing (SAT)}, in press},
	year={2024},
	doi={10.4230/LIPIcs.SAT.2024.6},
	url_PDF={https://dominikschreiber.de/papers/2024-sat-trusted-pre.pdf},
}

@unpublished{schreiber2024hopc,
	title={Scalable {SAT} Solving on Demand (Abstract)},
	author={Schreiber, Dominik and Sanders, Peter},
	note={{Highlights of Parallel Computing (HOPC)}, in press},
	year={2024},
	doi={https://doi.org/10.1145/3670684.3673414},
	url_PDF={https://dominikschreiber.de/papers/2024-hopc-scalable.pdf},
	url_Slides={https://dominikschreiber.de/slides/2024-hopc-scalable.pdf},
	url_Poster={https://dominikschreiber.de/posters/2024-hopc-scalable.pdf},
}

@unpublished{schreiber2024mallob,
	title={{MallobSat} and {MallobSat-ImpCheck} in the {SAT} Competition 2024},
	author={Schreiber, Dominik},
	note={{International SAT Competition 2024: Solver and Benchmark Descriptions}, to appear},
	year={2024},
	url_PDF={https://dominikschreiber.de/papers/2024-mallob.pdf},
}

@unpublished{akram2024optimal,
	title={Optimal Parallel Task Scheduling via {SAT}},
	author={Akram, Matthew and Schreiber, Dominik},
	note={{International SAT Competition 2024: Solver and Benchmark Descriptions}, to appear},
	year={2024},
	url_PDF={https://dominikschreiber.de/papers/2024-isc-pcmax.pdf},
}

@unpublished{borowitz2024empirical,
	title={An Empirical Study on Learned Clause Overlaps in Distributed {SAT} Solving},
	author={Borowitz, Jannick and Schreiber, Dominik and Sanders, Peter},
	note={Pragmatics of SAT (PoS), to appear},
	year={2024},
	url_PDF={https://dominikschreiber.de/papers/2024-pos-empirical.pdf},
}

@phdthesis{schreiber2023scalable,
    author       = {Schreiber, Dominik},
    year         = {2023},
    title        = {Scalable SAT Solving and its Application},
    doi          = {10.5445/IR/1000165224},
    publisher    = {{Karlsruhe Institute of Technology (KIT)}},
    keywords     = {SAT solving, Distributed algorithms, Automated planning, Proofs, Automated reasoning, High-performance computing, Propositional logic, Symbolic AI, Algorithm engineering},
    pagetotal    = {234},
    school       = {Karlsruhe Institute of Technology (KIT)},
    language     = {english},
    url_PDF={https://dominikschreiber.de/papers/dissertation-dpschreiber-2023.pdf},
    url_Slides={https://dominikschreiber.de/slides/2023-defense.pdf},
}

@InProceedings{michaelson2023unsatisfiability,
	author       = {Michaelson, Dawn and Schreiber, Dominik and Heule, Marijn J. H. and Kiesl-Reiter, Benjamin and Whalen, Michael W.},
	title        = {{Unsatisfiability proofs for distributed clause-sharing {SAT} solvers}},
	booktitle    = {Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)},
	year         = {2023},
	organization = {Springer},
	pages        = {348--366},
	doi          = {10.1007/978-3-031-30823-9_18},
	note={{(Nominated for a best paper award)}},
	url_PDF={https://dominikschreiber.de/papers/2023-unsatisfiability-accepted.pdf},
	url_Slides={https://dominikschreiber.de/slides/2023-tacas-unsatisfiability.pdf},
}

@InProceedings{schreiber2023mallob,
  author    = {Schreiber, Dominik},
  title     = {Mallob(32,64,1600) in the {SAT} Competition 2023},
  booktitle = {International SAT Competition: Benchmark and Solver Descriptions},
  year      = {2023},
  pages     = {46--47},
  url_PDF={https://dominikschreiber.de/papers/2023-mallob.pdf},
}

@Article{sanders2022mallob,
	author  = {Sanders, Peter and Schreiber, Dominik},
	title   = {Mallob: Scalable {SAT} Solving On Demand With Decentralized Job Scheduling},
	journal = {Journal of Open Source Software (JOSS)},
	year    = {2022},
	volume  = {7},
	number  = {76},
	pages   = {4591},
	doi     = {10.21105/joss.04591},
	url_PDF={https://dominikschreiber.de/papers/2022-joss-mallob.pdf},
}

@InProceedings{sanders2022decentralized,
	author       = {Sanders, Peter and Schreiber, Dominik},
	title        = {{Decentralized online scheduling of malleable {NP}-hard jobs}},
	booktitle    = {Int. European Conf. on Parallel Processing (Euro-Par)},
	year         = {2022},
	organization = {Springer},
	pages        = {119--135},
	doi          = {10.1007/978-3-031-12597-3_8},
	note={{(Nominated for a best paper award)}},
	url_PDF={https://dominikschreiber.de/papers/2022-europar-decentralized.pdf},
	url_Slides={https://dominikschreiber.de/slides/2022-europar-decentralized.pdf},
}

@InProceedings{schreiber2022mallob,
  author    = {Schreiber, Dominik},
  title     = {Mallob in the {SAT} Competition 2022},
  booktitle = {International SAT Competition: Benchmark and Solver Descriptions},
  year      = {2022},
  pages     = {46--47},
  url_PDF={https://dominikschreiber.de/papers/2022-mallob.pdf},
}

@unpublished{schreiber2022helmholtz,
	title={(poster only) Scalable Satisfiability-based Problem Solving},
	author={Schreiber, Dominik and Sanders, Peter},
	note={Helmholtz AI Conference},
	year={2022},
	url_Poster={https://dominikschreiber.de/posters/2022-helmholtz-scalable.pdf},
}

@Article{schreiber2021lilotane,
	author  = {Schreiber, Dominik},
	title   = {{Lilotane: A Lifted {SAT}-Based Approach to Hierarchical Planning}},
	journal = {Journal of Artificial Intelligence Research (JAIR)},
	year    = {2021},
	volume  = {70},
	pages   = {1117--1181},
	doi     = {10.1613/jair.1.12520},
	note={Presented at {International Joint Conference of Artificial Intelligence (IJCAI)}, 2021},
	url_PDF={https://dominikschreiber.de/papers/2021-jair-lilotane.pdf},
	url_Slides={https://dominikschreiber.de/slides/2021-ijcai-lilotane.pdf},
	url_Poster={https://dominikschreiber.de/posters/2021-ijcai-lilotane.pdf},
	url_Video={https://youtu.be/-0cRYmcpQRg},
}

@InProceedings{schreiber2021scalable,
  author       = {Schreiber, Dominik and Sanders, Peter},
  title        = {Scalable {SAT} Solving in the Cloud},
  booktitle    = {Int. Conf. on Theory and Applications of Satisfiability Testing (SAT)},
  year         = {2021},
  organization = {Springer},
  pages        = {518--534},
  doi          = {10.1007/978-3-030-80223-3_35},
	url_PDF={https://dominikschreiber.de/papers/2021-sat-scalable.pdf},
	url_Slides={https://dominikschreiber.de/slides/2021-sat-scalable.pdf},
	url_Video={https://youtu.be/DuM5hkSX-58}
}

@InProceedings{hespe2021scalable,
	title={Scalable discrete algorithms for big data applications},
	author={Hespe, Demian and H{\"u}bner, Lukas and H{\"u}bschle-Schneider, Lorenz and Sanders, Peter and Schreiber, Dominik},
	booktitle={Int. Conf. on High Performance Computing in Science and Engineering},
	pages={439--449},
	year={2021},
	organization={Springer},
	doi={10.1007/978-3-031-17937-2_27},
	url_Slides={https://dominikschreiber.de/slides/2024-hlrs-scalable.pdf}
}

@InProceedings{schreiber2021mallob,
  author    = {Schreiber, Dominik},
  title     = {Mallob in the {SAT} Competition 2021},
  booktitle = {Proceedings of International SAT Competition: Solver and Benchmark Descriptions},
  year      = {2021},
  pages     = {38--39},
  url_PDF={https://dominikschreiber.de/papers/2021-mallob.pdf},
}

@InProceedings{soennichsen2021factories,
  author    = {S{\"o}nnichsen, Malte and Schreiber, Dominik},
  title     = {The ``{Factories}'' {HTN} Domain},
  booktitle = {Proc. International Planning Competition},
  year      = {2021},
  pages     = {45--46},
  url_PDF={https://dominikschreiber.de/papers/2020-ipc-factories.pdf},
}

@InProceedings{schreiber2021lifted,
  author    = {Schreiber, Dominik},
  title     = {Lifted logic for task networks: {TOHTN} planner {Lilotane} in the {IPC} 2020},
  booktitle = {Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},
  year      = {2021},
  pages     = {9--12},
  url_PDF={https://dominikschreiber.de/papers/2020-ipc-lilotane.pdf},
}

@InProceedings{schreiber2020engineering,
  author    = {Schreiber, Dominik},
  title     = {Engineering {HordeSat} towards malleability: mallob-mono in the {SAT} 2020 cloud track},
  booktitle = {International SAT Competition: Benchmark and Solver Descriptions},
  year      = {2020},
  pages     = {45--46},
  url_PDF={https://dominikschreiber.de/papers/2020-mallob-mono.pdf},
}

@InProceedings{schreiber2019tree,
	author    = {Schreiber, Dominik and Pellier, Damien and Fiorino, Humbert and Balyo, Tom{\'a}{\v{s}}},
	title     = {{Tree-REX}: {SAT}-based tree exploration for efficient and high-quality {HTN} planning},
	booktitle = {Int. Conf. on Automated Planning and Scheduling (ICAPS)},
	year      = {2019},
	pages     = {382--390},
	doi       = {10.1609/icaps.v29i1.3502},
	url_PDF={https://dominikschreiber.de/papers/2019-icaps-treerex.pdf},
	url_Slides={https://dominikschreiber.de/slides/2019-icaps-treerex.pdf},
}

@InProceedings{schreiber2019efficient,
	author    = {Schreiber, Dominik and Pellier, Damien and Fiorino, Humbert and Balyo, Tom{\'a}{\v{s}}},
	title     = {Efficient {SAT} Encodings for Hierarchical Planning},
	booktitle = {Int. Conf. on Agents and Artificial Intelligence (ICAART)},
	year      = {2019},
	volume    = {2},
	pages     = {531--538},
	doi       = {10.5220/0007343305310538},
	url_PDF={https://dominikschreiber.de/papers/2019-icaart-efficient.pdf},
	url_Slides={https://dominikschreiber.de/slides/2019-icaart-efficient.pdf},
}

@InProceedings{froleyks2019pasar,
	author    = {Froleyks, Nils and Balyo, Tom{\'a}{\v{s}} and Schreiber, Dominik},
	title     = {{PASAR}---Planning as Satisfiability with Abstraction Refinement},
	booktitle = {Symposium on Combinatorial Search (SoCS)},
	year      = {2019},
	volume    = {10},
	number    = {1},
	pages     = {70--78},
	url       = {https://ojs.aaai.org/index.php/SOCS/article/download/18504/18295},
	url_PDF={https://dominikschreiber.de/papers/2019-socs-pasar.pdf},
}

@InProceedings{froleyks2019sparkle,
  author    = {Froleyks, Nils and Balyo, Tom{\'a}{\v{s}} and Schreiber, Dominik},
  title     = {PASAR Entering the Sparkle Planning Challenge 2019},
  booktitle = {Proc. Sparkle Planning Challenge},
  year      = {2019},
  url_PDF={https://dominikschreiber.de/papers/2019-sparkle-pasar.pdf}
}

@mastersthesis{schreiber2018hierarchical,
	title={Hierarchical task network planning using {SAT} techniques},
	author={Schreiber, Dominik},
	type={Master's thesis},
	school={Grenoble Institut National Polytechnique (INP) and Karlsruhe Institute of Technology (KIT)},
	year={2018},
	doi={10.5445/IR/1000104165},
	url_PDF={https://dominikschreiber.de/papers/master-thesis.pdf},
	url_Slides={https://dominikschreiber.de/slides/2018-master.pdf},
}

@mastersthesis{schreiber2016energieeffiziente,
	title={Energieeffiziente Ausf{\"u}hrung von qualit{\"a}tsbewussten Algorithmen f{\"u}r Mobile Simulationen},
	author={Schreiber, Dominik},
	type={Bachelor's thesis},
	school={Universit{\"a}t Stuttgart},
	year={2016},
	url_PDF={https://dominikschreiber.de/papers/bachelor-thesis.pdf},
	url_Slides={https://dominikschreiber.de/slides/2016-bachelor.pdf},
}