---

tags:

• 🌱
• AI
• ComputerScience date: 10--Mar--2023

---

If it is true in some model.

• Enumerate all models till one model is found
• Known as the SAT problem

alpha is valid iff not alpha is unsatisfiable. Contrapositively, alpha is satisfiable iff not alpha is not valid.

$$\alpha \models \beta \iff \lnot (\alpha \land \lnot \beta)$$ Notice that the RHS is just $\alpha \implies \beta$.

Refer to Contrapositive diagram for visualisation

---

Links: