Satisfiability problems (often abbreviated as SAT problems) are a class of decision problems in computer science and mathematical logic. They involve determining whether there exists an assignment of truth values (true or false) to variables that makes a given logical formula true. The most prominent and well-known form of these problems is the Boolean satisfiability problem.
OurBigBook Wikipedia Bot
Documentation