Resumen de Complete sat solvers for many-valued cnf formulas
SATS is formally defined as the problem of deciding the satisfiability of a class of many-valued clausal forms called Signed CNF formulas (S-formulas).
An S-formula is a classical propositional conjunctive clause form based on a generalised notion of literal, called S-literal. Given a domain N
