We present a transformation of formulae from arbitrary finitely-valued logics into a conjunctive normal form based on signed atomic formulae which can be used to syntactically characterize many-valued validity with a simple resolution rule very much like in classical logic. The transformation is always linear with relation to the size of the input, and we define a generalized concept of polarity in order to remove clauses which are not needed in the proof. The transformation rules are based on the concept of ’sets-as-signs’ developed earlier by the author in the context of tableau-based deduction in many-valued logics. We claim that the approach presented here is much more efficient than existing approaches to many-valued resolution.