1. Cook, S.A. (1971). The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, ACM (pp. 151–158).
2. Zhang, H. (1997). SATO: An efficient prepositional prover. In Automated Deduction-CADE-14, Springer, 272–275.
3. Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S. (2001). Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, IEEE Press (pp. 279–285).
4. Gomes, C.P., Selman, B., Kautz, H., et al. (1998). Boosting combinatorial search through randomization. AAAI/IAAI, 98, 431–437.
5. Eén, N., & Sörensson, N. (2003). An extensible SAT-solver. In International conference on theory and applications of satisfiability testing, Springer (pp. 502–518).