Welcome to Science Reader!
SAT solvers determine whether Boolean logic formulas can be satisfied. The problem was the first ever proved NP-complete.