LAC
/
Questionnaire-2024
3
0
Fork 0
Code Issues Pull Requests Projects Releases 12 Wiki Activity
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.
7 Commits
1 Branch
12 Tags
1.2 MiB
Tree: 5be6e3e72c
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '5be6e3e72c'
${ noResults }
Questionnaire-2024/equivalence_checking/0009.tex

3 lines
274 B
Raw Normal View History

added eqchecking chapter
3 months ago
​
​
  1. \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.
  2. Follow the algorithm discussed in the lecture and state the final formula that is used as input for a SAT solver.