medium
2 min read
Boolean SAT
Boolean Satisfiability (SAT) A Boolean formula is a combination of logical operators and variables that can be either True or False. A Boolean formula repre...
Quick Actions
Insights
Difficultymedium
Reading Time2 min
Boolean Satisfiability (SAT) A Boolean formula is a combination of logical operators and variables that can be either True or False. A Boolean formula repre...
Boolean Satisfiability (SAT)
A Boolean formula is a combination of logical operators and variables that can be either True or False. A Boolean formula represents a statement that is either true or false.
A Boolean formula can be represented using the logical operators:
AND (AND): A formula where two or more variables are combined using the AND operator. For example, (x == 1 AND y == 2) is a formula that is true if both x and y are equal to 1.
OR (OR): A formula where one or more variables are combined using the OR operator. For example, (x == 1 OR y == 2) is a formula that is true if either x or y is equal to 1.
NOT (NOT): A formula where one variable is combined using the NOT operator. For example, (x == 1 NOT y == 2) is a formula that is true if x is equal to 1 but y is equal to 2.
A Boolean formula can also be represented using a truth table. A truth table is a table that shows the truth value of a formula for all possible combinations of truth values of the variables involved.
| Variable 1 | Variable 2 | Variable 3 | Formula |
|---|---|---|---|
| True | True | True | True |
| True | True | False | False |
| True | False | True | True |
| True | False | False | False |
| False | True | True | True |
| False | True | False | False |
| False | False | True | True |
| False | False | False | False |