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.
3 lines
180 B
3 lines
180 B
\item Given a propositional logic formula $\varphi$, the Tseitin transformation computes an
|
|
equisatisfiable formula $\varphi'$ in CNF.
|
|
Why is this enough for equivalence checking?
|