20 lines
711 B
Markdown
20 lines
711 B
Markdown
---
|
|
title: Satisfiability
|
|
---
|
|
## Satisfiability
|
|
|
|
Satisfiability refers to the existence of a combination of values to make the expression true. So in short, a proposition is satisfiable if there is at least one true result in its truth table, valid if all values it returns in the truth table are true.
|
|
|
|
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 : is Satisfiable with x = T, y = F or x = F, y = T
|
|
|
|
If there are no assignments, then it is considered Unsatisfiable.
|
|
|
|
|
|
#### More Information:
|
|
|
|
[Satisfiability explained - YouTube](https://www.youtube.com/watch?v=yo7aULLUz_0)
|