1. Ábrahám, E., et al.: SC$$^{2}$$: Satisfiability checking meets symbolic computation - (project paper). In: CICM (2016)
2. Balunovic, M., Bielik, P., Vechev, M.T.: Learning to solve SMT formulas. In: NeurIPS, pp. 10338–10349 (2018)
3. Lecture Notes in Computer Science;H Barbosa,2022
4. Barrett, C., Fontaine, P., Tinelli, C.: The satisfiability modulo theories library (SMT-LIB). www.SMT-LIB.org (2016)
5. Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Technical Report, The University of Iowa (2017). www.SMT-LIB.org