1. Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Dynamic symmetry-breaking for boolean satisfiability. Ann. Math. Artif. Intell. 57(1), 59–73 (2009)
2. Audemard, G., Jabbour, S., Sais, L.: Symmetry breaking in quantified boolean formulae. In: Veloso, M.M. (ed.) Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, pp. 2262–2267 (2007)
3. Audemard, G., Mazure, B., Sais, L.: Dealing with symmetries in quantified boolean formulas. In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing (2004)
4. Lecture Notes in Computer Science;V Balabanov,2014
5. Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. (JAIR) 22, 319–351 (2004)