TítuloMapping many-valued CNF Formulas to Boolean CNF Formulas
Publication TypeConference Paper
Year of Publication2005
AuthorsAnsótegui C, Manyà F
Conference NameProc. 35th Intern. Symposium on Multiple-Valued logics ISMVL
Paginación290 - 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.