1. Aigner, M., Biere, A., Kirsch, C.M., Niemetz, A., Preiner, M.: Analysis of portfolio-style parallel SAT solving on current multi-core architectures. In: Fourth Pragmatics of SAT workshop, a workshop of the SAT 2013 conference. POS-13, pp. 28–40 (2013)
2. Alama, J., Heskes, T., Kühlwein, D., Tsivtsivadze, E., Urban, J.: Premise selection for mathematics by corpus analysis and kernel methods. J. Autom. Reason. 52(2), 191–213 (2014)
3. Aloul, F., Sierawski, B., Sakallah, K.: A tool for measuring progress of backtrack-search solvers. In: Theory and Applications of Satisfiability Testing - SAT 2002 (2002)
4. Amadini, R., Gabbrielli, M., Mauro, J.: Sunny: a lazy portfolio approach for constraint solving. Theory Pract. Logic Program. 14(4-5), 509–524 (2014)
5. Audemard, G., Hoessen, B., Jabbour, S., Lagniez, J.-M., Piette, C.: Revisiting clause exchange in parallel SAT solving. In: Theory and Applications of Satisfiability Testing – SAT 2012, pp. 200–213. Springer, Berlin (2012)