Complex sentence: In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of determining if the variables of a given Boolean formula can be assigned in such a way as to make the formula evaluate to TRUE.
Split into simpler sentences: In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of determining if there exists an interpretation, which satisfies the formula. In other words, it establishes if the variables of a given Boolean formula can be assigned in such a way as to make the formula evaluate to TRUE.