Is there a way to change the satisfiability of a SAT problem without knowing whether the original problem is satisfiable or not beforehand?

There are satisfiability-preserving operations like removing supersets or resolution that maintain the satisfiability status of a problem independent of its label. Is there a way to do the opposite?