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/4_1_tseitin_lect.tex

3 lines
229 B
Raw Normal View History

added eqchecking chapter
3 months ago
​
​
​
  1. \item \lect Explain the concept of equisatisfiability.
  2. Given a propositional logic formula $\varphi$, the Tseitin algorithm computes an
  3. equisatisfiable formula $CNF(\varphi)$ in CNF.
  4. Why is this enough for equivalence checking?