1. Ábrahám, E.: Building bridges between symbolic computation and satisfiability checking. In: Robertz, D. (ed.) Proceedings ISSAC 2015, pp. 1–6 (2015)
2. Ábrahám, E., Becker, B., Bigatti, A., Buchberger, B., Cimatti, C., Davenport, J.H., England, M., Fontaine, P., Forrest, S., Kroening, D., Seiler, W., Sturm, T.: SC $$^2$$ 2 : satisfiability checking meets symbolic computation (project paper). Proc. CICM 2016, 28–43 (2016)
3. Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Feng, R., Lee, W.-s., Sato, Y. (eds.) Computer Mathematics, pp. 199–221. Springer, Berlin (2014)
4. Davenport, J.H.: Dataset supporting ’What Does “Without Loss of Generality” Mean (And How Do We Detect It)’. http://doi.org/10.5281/zenodo.305441 (2017)
5. England, M., Wilson, D.J., Bradford, R., Davenport, J.H.: Using the Regular Chains Library to build cylindrical algebraic decompositions by projecting and lifting. Proc. ICMS 2014, 458–465 (2014)