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.
35 Commits
1 Branch
12 Tags
1.2 MiB
Tree: c3f7486573
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'c3f7486573'
${ noResults }
Questionnaire-2024/smt/3001.tex

2 lines
203 B
Raw Normal View History

added smt chapter
7 months ago
​
  1. \item Use the lazy encoding approach to check whether the formula $\varphi$ in $\EUF$ is satisfiable.
  2. $$\varphi := (g(a) = c) \land \big( (f(g(a)) \neq f(c)) \lor (g(a) = d)) \big) \land (c \neq d) $$