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.
13 Commits
1 Branch
12 Tags
1.2 MiB
Tree: 4891ec7200
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '4891ec7200'
${ noResults }
Questionnaire-2024/equivalence_checking/practical_questions/5_1_cec_lect.tex

0 lines
250 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. Prepare everything until you have a formula CNF($\phi$), that you can give to a SAT solver.