Follow
Dominik P. Schreiber
Title
Cited by
Cited by
Year
Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning
D Schreiber
Journal of Artificial Intelligence Research 70, 1117-1181, 2021
422021
Scalable SAT Solving in the Cloud
D Schreiber, P Sanders
Proceedings of SAT, 2021
372021
Tree-REX: SAT-based tree exploration for efficient and high-quality HTN planning
D Schreiber, D Pellier, H Fiorino, T Balyo
Proceedings of the International Conference on Automated Planning and …, 2019
352019
Decentralized online scheduling of malleable NP-hard jobs
P Sanders, D Schreiber
Euro-Par 2022: Parallel Processing: 28th International Conference on …, 2022
132022
Engineering HordeSat Towards Malleability: mallob-mono in the SAT 2020 Cloud Track
D Schreiber
Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions, 45-46, 2020
102020
Mallob in the SAT Competition 2021
D Schreiber
Proceedings of SAT Competition 2021 : Solver and Benchmark Descriptions, 38-39, 2021
92021
Lifted logic for task networks: TOHTN planner lilotane in the IPC 2020
D Schreiber
Proceedings of 10th International Planning Competition: planner and domain …, 2021
92021
Unsatisfiability proofs for distributed clause-sharing SAT solvers
D Michaelson, D Schreiber, MJH Heule, B Kiesl-Reiter, MW Whalen
Tools and Algorithms for the Construction and Analysis of Systems: 29th …, 2023
82023
Scalable SAT Solving and its Application
DP Schreiber
82023
PASAR—Planning as Satisfiability with Abstraction Refinement
N Froleyks, T Balyo, D Schreiber
Proceedings of the International Symposium on Combinatorial Search 10 (1), 70-78, 2019
82019
Efficient SAT encodings for hierarchical planning
D Schreiber, D Pellier, H Fiorino, T Balyo
11th International Conference on Agents and Artificial Intelligence (ICAART …, 2019
72019
Finding optimal longest paths by dynamic programming in parallel
K Fieger, T Balyo, C Schulz, D Schreiber
Proceedings of the International Symposium on Combinatorial Search 10 (1), 61-69, 2019
52019
MallobSat: Scalable SAT solving by clause sharing
D Schreiber, P Sanders
Journal of Artificial Intelligence Research 80, 1437-1495, 2024
42024
The 2023 International Planning Competition
A Taitler, R Alford, J Espasa, G Behnke, D Fišer, M Gimelfarb, ...
AI Magazine, 2024
42024
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling
P Sanders, D Schreiber
Journal of Open Source Software 7 (76), 4591, 2022
42022
Mallob{32, 64, 1600} in the SAT Competition 2023
D Schreiber
SAT COMPETITION 2023, 46, 0
3*
Hierarchical task network planning using SAT techniques
D Schreiber, D PELLIER, H FIORINO
Master’s thesis, Grenoble Institut National Polytechnique, Karlsruhe …, 2018
22018
PASAR Entering the Sparkle Planning Challenge 2019
N Froleyks, T Balyo, D Schreiber
12019
Trusted Scalable SAT Solving with on-the-fly LRAT Checking
D Schreiber
27th International Conference on Theory and Applications of Satisfiability …, 2024
2024
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines
M Akram, D Schreiber
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20