595 B
595 B
| title |
|---|
| Satisfiability |
Satisfiability
A formula P is considered satisfiable if it is sometimes true for some assignment of true/false to the variables.
Example:
- x ^ y : is Satisfiable with x = T, y = T
- x v y -> x : is Satisfiable with x = T, y = F
If there are no assignments, then it is considered Unsatisfiable.