[1]
Froleyks, N. et al. 2021. PASAR — Planning as Satisfiability with Abstraction Refinement. Proceedings of the International Symposium on Combinatorial Search. 10, 1 (Sep. 2021), 70–78. DOI:https://doi.org/10.1609/socs.v10i1.18504.