1. Ansótegui, C., & Manyá, F. (2004). Mapping problems with finite-domain variables into problems with Boolean variables. In Proceedings of the seventh international conference on theory and applications of satisfiability testing (SAT’04). LNCS (Vol. 3542, pp. 1–15).
2. Bailleux, O., & Boufkhad, Y. (2003). Efficient CNF encoding of Boolean cardinality constraints. In F. Rossi (Ed.), Proceedings of the 9th international conference on principles and practice of constraint programming (CP2003). LNCS (Vol. 2833, pp. 108–122).
3. Barcelogic for SMT. www.lsi.upc.es/∼oliveras/bclt-main.html . Accessed 07 February.
4. Benchmarks for Lazy Clause Generation. http://www.cs.mu.oz.au/~olgao/benchmarks.htm . Accessed 07 December.
5. Cabon, B., de Givrey, S., Lobjois, L., Schiex, T., & Warners, L.P. (1999). Radio link frequency assignment. Constraints, 4(1), 78–89.