1. Gavrilov, S.V., Glebov, A.L., and Stempkovskii, A.L., Metody logicheskogo i logiko-vremennogo analiza tsifrovykh KMOP SBIS (Methods of Logical and Logical-Time Analysis of Digital CMOS VLSI), Moscow: Nauka, 2007.
2. Cook, S., The complexity of theorem proving procedures, in Proceedings of the 3rd Annual ACM Symposium on Theory of Computing,
1971, pp. 151–158.
3. Levin, L.A., Generic enumeration problems, Probl. Pered. Inform., 1973, vol. 9, no. 3, pp. 115–116.
4. Koen, C., Eén, N., Sheeran, M., et al., SAT-solving in practice, with a tutorial example from supervisory control, Discrete Event Dyn. Syst., 2009, vol. 19, no. 4, pp. 495–524.
5. Ohrimenko, O., Stuckey, P.J., and Codish, M., Propagation = Lazy clause generation, in Principles and Practice of Constraint Programming CP 2007, Proceedings of the 13th International Conference, Providence, RI, USA, Sept. 25-29,