1. Anders, M.: SAT preprocessors and symmetry. In: Meel, K.S., Strichman, O. (eds.) 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, 2–5 August 2022, Haifa, Israel. LIPIcs, vol. 236, pp. 1:1–1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022). https://doi.org/10.4230/LIPIcs.SAT.2022.1
2. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979). https://doi.org/10.1016/0020-0190(79)90002-4
3. Bacchus, F.: Enhancing davis putnam with extended binary clause reasoning. In: Dechter, R., Kearns, M.J., Sutton, R.S. (eds.) Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, 28 July–1 August 2002, Edmonton, Alberta, Canada, pp. 613–619. AAAI Press/The MIT Press (2002). http://www.aaai.org/Library/AAAI/2002/aaai02-092.php
4. Berre, D.L.: Exploiting the real power of unit propagation lookahead. Electron. Notes Discret. Math. 9, 59–80 (2001). https://doi.org/10.1016/S1571-0653(04)00314-2
5. Biere, A.: Resolve and expand. In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10–13 May 2004, Vancouver, BC, Canada, Online Proceedings (2004). http://www.satisfiability.org/SAT04/programme/93.pdf