Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks

von Balyo, Tomás
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

PASAR - Planning as Satisfiability with Abstraction Refinement

von Froleyks, Nils
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

Finding Optimal Longest Paths by Dynamic Programming in Parallel

von Fieger, Kai
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning

von Schreiber, Dominik
Veröffentlicht in International Conference on Automated Planning and Scheduling (29. : 2019 : Berkeley, Calif.) Proceedings of the Twenty-ninth International Conference on Automated Planning and Scheduling (2019)