M. Allamanis, P. Chanthirasegaran, P. Kohli, and C. Sutton, Learning continuous semantic representations of symbolic expressions, Proceedings of Machine Learning Research, vol.70, pp.80-88, 2017.

T. Bouton, D. Caminha, B. De-oliveira, D. Déharbe, and P. Fontaine, veriT: an open, trustable and efficient SMT-solver, LNCS, vol.5663, pp.151-156, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00430634

T. Chen and C. Guestrin, XGBoost: a scalable tree boosting system, pp.785-794, 2016.

L. De-moura and N. Bjørner, Efficient E-matching for SMT solvers, LNCS, vol.4603, pp.183-198, 2007.

G. Irving, C. Szegedy, A. A. Alemi, N. Een, F. Chollet et al., DeepMath-deep sequence models for premise selection, pp.2235-2243, 2016.

J. Jakubuv and J. Urban, ENIGMA: efficient learning-based inference guiding machine, LNCS, vol.10383, pp.292-302, 2017.

C. Kaliszyk, J. Urban, H. Michalewski, and M. Ol?ák, Reinforcement learning of theorem proving, pp.8835-8846, 2018.

C. Kaliszyk, J. Urban, and J. Vysko?il, Efficient semantic features for automated reasoning over large theories, pp.3084-3090, 2015.

S. Loos, G. Irving, C. Szegedy, and C. Kaliszyk, Deep network guided proof search, LPAR-21, vol.46, pp.85-105, 2017.

B. Piotrowski and J. Urban, ATPboost: Learning premise selection in binary setting with ATP feedback, LNCS, vol.10900, pp.566-574, 2018.

A. Reynolds, H. Barbosa, and P. Fontaine, Revisiting enumerative instantiation, TACAS 2018, vol.10806, pp.112-131, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01877055

A. Reynolds, C. Tinelli, and L. De-moura, Finding conflicting instances of quantified formulas in SMT, pp.195-202, 2014.