1. Aavani, A., Mitchell, D.G., Ternovska, E. (2013). New encoding for translating pseudo-boolean constraints into SAT. In Proceedings of the 10th symposium on abstraction, reformulation, and approximation, SARA 2013, 11-12 July 2013, Leavenworth, Washington, USA. AAAI Press.
http://www.aaai.org/ocs/index.php/SARA/SARA13/paper/view/7212
.
2. Abío, I., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., Mayer-Eichberger, V. (2012). A new look at BDDs for Pseudo-Boolean constraints. Journal of Artificial Intelligence Research, 45(1), 443–480.
https://doi.org/10.1613/jair.3653
.
3. Aggoun, A., & Vazacopoulos, A. (2004). Solving sports scheduling and timetabling problems with constraint programming. In Butenko, S., Gil-Lafuente, J. & Pardalos, P.M. (Eds.) Economics, management and optimization in sports (pp. 243–264). Berlin: Springer.
https://doi.org/10.1007/978-3-540-24734-0_15
.
4. Ansótegui, C., Bonet, M.L., Levy, J. (2009). Solving (weighted) partial MaxSAT through satisfiability testing. In Kullmann, O. (Ed.) Theory and applications of satisfiability testing - SAT 2009, 12th international conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, Lecture Notes in Computer Science (Vol. 5584, pp. 427–440). Berlin: Springer.
https://doi.org/10.1007/978-3-642-02777-2_39
.
5. Ansótegui, C., Bonet, M.L., Levy, J. (2010). A new algorithm for weighted partial MaxSAT. In Proceedings of the 24th AAAI conference on artificial intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. AAAI Press.
http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1774
.