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
274 B
3 lines
274 B
\item \lect Check whether $\phi_1 = a \land \lnot b$ and $\phi_2 = \lnot ( \lnot a \lor b)$ are semantically equivalent using the reduction to satisfiability.
|
|
Follow the algorithm discussed in the lecture and state the final formula that is used as input for a SAT solver.
|
|
|