Matthias Baaz, Anela Lolic. Andrews Skolemization May Shorten Resolution Proofs Non-elementarily. In Sergei N. Artëmov, Anil Nerode, editors, Logical Foundations of Computer Science - International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings. Volume 13137 of Lecture Notes in Computer Science, pages 9-24, Springer, 2022. [doi]
Abstract is missing.