1. Aloul, F. A., Markov, I. L., & Sakallah, K. A. (2003a). Shatter: Efficient symmetry-breaking for Boolean satisfiability. In Proceedings of DAC-03: 40th design automation conference (pp. 836–839). Anahein, CA, June 2003.
2. Aloul, F. A., Ramani, A., Markov, I. L., & Sakallah, K. A. (2002). PBS: A backtrack-search pseudo-Boolean solver and optimizer. In Proceedings of SAT-02: 5th international conference on theory and applications of satisfiability testing (pp. 346–353). Cincinnati, OH, May 2002.
3. Aloul, F. A., Ramani, A., Markov, I. L., & Sakallah, K. A. (2003b). Solving difficult instances of Boolean satisfiability in the presence of symmetry. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 22(9), 1117–1137.
4. Aloul, F. A., Sakallah, K. A., & Markov, I. L. (2006). Efficient symmetry breaking for Boolean satisfiability. IEEE Transactions on Computers, 55(5), 549–558.
5. Bayardo Jr., R. J. & Schrag, R. C. (1997). Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of AAAI-97: 14th conference on artificial intelligence (pp. 203–208). Providence, RI, July 1997.