Folgen
Dominik P. Schreiber
Titel
Zitiert von
Zitiert von
Jahr
Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning
D Schreiber
Journal of Artificial Intelligence Research 70, 1117-1181, 2021
362021
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
332019
Scalable SAT Solving in the Cloud
D Schreiber, P Sanders
Proceedings of SAT, 2021
202021
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
Decentralized online scheduling of malleable NP-hard jobs
P Sanders, D Schreiber
Euro-Par 2022: Parallel Processing: 28th International Conference on …, 2022
72022
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
72020
Mallob in the SAT Competition 2021
D Schreiber
Proceedings of SAT Competition 2021 : Solver and Benchmark Descriptions, 38-39, 2021
62021
Lifted logic for task networks: TOHTN planner lilotane in the IPC 2020
D Schreiber
Proceedings of 10th International Planning Competition: planner and domain …, 2021
62021
Efficient SAT encodings for hierarchical planning
D Schreiber, D Pellier, H Fiorino, T Balyo
11th International Conference on Agents and Artificial Intelligence (ICAART …, 2019
62019
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
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
32023
Hierarchical task network planning using SAT techniques
D Schreiber, D PELLIER, H FIORINO
Master’s thesis, Grenoble Institut National Polytechnique, Karlsruhe …, 2018
22018
Scalable SAT Solving and its Application
DP Schreiber
12023
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling
P Sanders, D Schreiber
Journal of Open Source Software 7 (76), 4591, 2022
12022
PASAR Entering the Sparkle Planning Challenge 2019
N Froleyks, T Balyo, D Schreiber
12019
The 2023 International Planning Competition
A Taitler, R Alford, J Espasa, G Behnke, D Fišer, M Gimelfarb, ...
AI Magazine, 2024
2024
Scalable discrete algorithms for big data applications
D Hespe, L Hübner, L Hübschle-Schneider, P Sanders, D Schreiber
High Performance Computing in Science and Engineering'21: Transactions of …, 2023
2023
Mallob in the SAT Competition 2022
D Schreiber
Proceedings of SAT Competition 2022 : Solver and Benchmark Descriptions, 46-47, 2022
2022
Aquaplanning: An Educational Framework for Automated Planning
T Balyo, D Schreiber, P Hegemann, J Trautmann
2019
Finding Optimal Longest Paths by Dynamic Programming in Parallel
T Balyo, K Fieger, D Schreiber, C Schulz
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20