3 Carlos Ansótegui Felip Manyà 2005 Proc. 35th Intern. Symposium on Multiple-Valued logics ISMVL IEEE 290 - 295 We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empirically on a set of benchmarks with a SAT solver. Our results show that encoding combinatorial problems with the mappings defined here can lead to substantial performance improvements in complete SAT solvers.