Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning D Schreiber Journal of Artificial Intelligence Research 70, 1117-1181, 2021 | 36 | 2021 |
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 | 33 | 2019 |
Scalable SAT Solving in the Cloud D Schreiber, P Sanders Proceedings of SAT, 2021 | 20 | 2021 |
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 | 8 | 2019 |
Decentralized online scheduling of malleable NP-hard jobs P Sanders, D Schreiber Euro-Par 2022: Parallel Processing: 28th International Conference on …, 2022 | 7 | 2022 |
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 | 7 | 2020 |
Mallob in the SAT Competition 2021 D Schreiber Proceedings of SAT Competition 2021 : Solver and Benchmark Descriptions, 38-39, 2021 | 6 | 2021 |
Lifted logic for task networks: TOHTN planner lilotane in the IPC 2020 D Schreiber Proceedings of 10th International Planning Competition: planner and domain …, 2021 | 6 | 2021 |
Efficient SAT encodings for hierarchical planning D Schreiber, D Pellier, H Fiorino, T Balyo 11th International Conference on Agents and Artificial Intelligence (ICAART …, 2019 | 6 | 2019 |
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 | 5 | 2019 |
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 | 3 | 2023 |
Hierarchical task network planning using SAT techniques D Schreiber, D PELLIER, H FIORINO Master˘s thesis, Grenoble Institut National Polytechnique, Karlsruhe …, 2018 | 2 | 2018 |
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling P Sanders, D Schreiber Journal of Open Source Software 7 (76), 4591, 2022 | 1 | 2022 |
PASAR Entering the Sparkle Planning Challenge 2019 N Froleyks, T Balyo, D Schreiber | 1 | 2019 |
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 |
Scalable SAT Solving and its Application DP Schreiber | | 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 |