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, Haifa, Israel, 2–5 August 2022. 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. Ausiello, G., Laura, L.: Directed hypergraphs: introduction and fundamental algorithms - a survey. Theor. Comput. Sci. 658, 293–306 (2017). https://doi.org/10.1016/j.tcs.2016.03.016
4. 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, Edmonton, Alberta, Canada, July 28 - August 1, 2002, pp. 613–619. AAAI Press / The MIT Press (2002). http://www.aaai.org/Library/AAAI/2002/aaai02-092.php
5. Lecture Notes in Computer Science;L Bachmair,1997