1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);E Ábrahám,2016
2. Alemi, A., Chollet, F., Een, N., Irving, G., Szegedy, C., Urban, J.: DeepMath-deep sequence models for premise selection. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS 2016, pp. 2243–2251, Curran Associates Inc. (2016).
https://papers.nips.cc/paper/6280-deepmath-deep-sequence-models-for-premise-selection.pdf
3. Arnon, D., Collins, G., McCallum, S.: Cylindrical algebraic decomposition I: the basic algorithm. SIAM J. Comput. 13, 865–877 (1984).
https://doi.org/10.1137/0213054
4. Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, Chap. 26, vol. 185 pp. 825–885. IOS Press (2009)
5. Bishop, C.: Pattern Recognition and Machine Learning. Springer, New York (2006)