You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
4 lines
229 B
4 lines
229 B
\item \lect Explain the concept of equisatisfiability.
|
|
Given a propositional logic formula $\varphi$, the Tseitin algorithm computes an
|
|
equisatisfiable formula $CNF(\varphi)$ in CNF.
|
|
Why is this enough for equivalence checking?
|