1. Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
2. E. Ábrahám , J.H. Davenport , M. England , G. Kremer , and Z. Tonks . New opportunities for the formal proof of computational real geometry? In Proc. SC2 2020 , CEUR-WS 2752, pages 178 -- 188 , 2020 . URL: http://ceur-ws.org/Vol-2752/. E. Ábrahám, J.H. Davenport, M. England, G. Kremer, and Z. Tonks. New opportunities for the formal proof of computational real geometry? In Proc. SC2 2020, CEUR-WS 2752, pages 178--188, 2020. URL: http://ceur-ws.org/Vol-2752/.
3. W. Hentze . Computing minimal infeasible subsets for Cylindrical Algebraic Decomposition. Thesis , 2017 . URL : https://ths.rwth-aachen.de/wp-content/uploads/sites/4/teaching/theses/hentze_bachelor.pdf W. Hentze. Computing minimal infeasible subsets for Cylindrical Algebraic Decomposition. Thesis, 2017. URL: https://ths.rwth-aachen.de/wp-content/uploads/sites/4/teaching/theses/hentze_bachelor.pdf
4. Solving Non-linear Arithmetic
5. Adapting Real Quantifier Elimination Methods for Conflict Set Computation