1. Alrabbaa, C., Baader, F., Borgwardt, S., Koopmann, P., Kovtunova, A.: Finding small proofs for description logic entailments: theory and practice. In LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp. 32–5 (2020)
2. Atserias, A., Müller, M.: Automating resolution is NP-hard. In: Zuckerman, D. (ed.) 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9–12, 2019, pp. 498–509. IEEE Computer Society (2019)
3. Avigad, J.: Automated reasoning for the working mathematician. In Frontiers of Combining Systems (FroCoS), London (2019). Invited Talk
4. Avigad, J., Dean, E., Mumma, J.: A formal system for Euclid’s elements. Rev. Symb. Logic 2, 700–768 (2009)
5. Beeson, M., Narboux, J., Wiedijk, F.: Proof-checking Euclid. Ann. Math. Artif. Intell. 85(2–4), 213–257 (2019)