Stefan Mengel, Friedrich Slivovsky. Proof Complexity of Symbolic QBF Reasoning. Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li and Felip Many`a), volume 12831 of Lecture Notes in Computer Science, pages 399-416, 2021, Springer.