1. Lecture Notes in Computer Science;V Balabanov,2014
2. Beyersdorff, O., Chew, L., Janota, M.: Proof complexity of resolution-based QBF calculi. In: STACS. LIPIcs, vol. 30, pp. 76–89. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)
3. Lecture Notes in Computer Science;A Biere,2005
4. Lecture Notes in Computer Science;P Faymonville,2017
5. Lecture Notes in Computer Science;K Fazekas,2017