Turing reducibility of 2 versions of the satisfiability problem
Any algorithm that decides the satisfiability of a formula can also be used to find an assignment for a satisfiable formula: 

While not all variables are assigned: 


Pick a variable and choose value 0. 
If formula is no longer satisfiable, replace value with 1.