1. Ansótegui, C., Béjar, R., Cabiscol, A., Li, C.M., Manyà, F.: Resolution methods for many-valued CNF formulas. In: Fifth International Symposium on the Theory and Applications of Satisfiability Testing, SAT 2002, Cincinnati, USA, pp. 156–163 (2002)
2. Ansótegui, C., Larrubia, J., Li, C.M., Manyà, F.: Mv-Satz: A SAT solver for many-valued clausal forms. In: 4th International Conference Journées de L’Informatique Messine, JIM 2003, Metz, France (2003)
3. Ansótegui, C., Manyà, F., Béjar, R., Gomes, C.: Solving many-valued SAT encodings with local search. In: Proceedings of the Workshop on Probabilistics Approaches in Search, 18th National Conference on Artificial Intelligence, AAAI 2002, Edmonton, Canada, 2002 (2002)
4. Bayardo, R.J., Schrag, R.C.: Using CSP look-back techniques to solve realworld SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence, AAAI 1997, Providence, RI, USA, pp. 203–208. AAAI Press, Menlo Park (1997)
5. Beckert, B., Hähnle, R., Manyà, F.: Transformations between signed and classical clause logic. In: Proceedings, International Symposium on Multiple-Valued Logics, ISMVL 1999, Freiburg, Germany, pp. 248–255. IEEE Press, Los Alamitos (1999)