The Boolean satisfiability problem is a kind of problem . In complexity theory , the satisfiability problem ( SAT ) is a decision problem , whose instance is a Boolean expression written using only AND , OR , NOT , variables , and parentheses .