1. F. Aloul, I. Markov, K. Sakallah, Efficient symmetry-breaking for Boolean satisfiability, in: International Joint Conference on Artificial Intelligence (IJCAI), 2003.
2. R. Bayardo, J. Pehoushek, Counting models using connected components, in: AAAI Proceedings, 2000.
3. A. Biere, A. Cimatti, E. Clarke, Y. Zhu, Symbolic Model Checking Without BDDs, Lecture Notes in Computer Science, vol. 1579, 1999, pp. 193–207. URL 〈http://citeseer.nj.nec.com/article/biere99symbolic.html〉.
4. J. Crawford, M. Ginsberg, E. Luks, A. Roy, Symmetry-breaking predicates for search problems, in: Fifth International Conference on Principles of Knowledge Representation and Reasoning, 1996.
5. R. Dechter, D. Frost, Backtracking algorithms for constraint satisfaction problems, Technical Report 56, UC-Irvine, 1999.