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

6 lines
512 B
Raw Permalink Normal View History

added smt chapter
2 months ago
​
​
​
​
​
​
  1. The satisfiability modulo theories (SMT) problem refers
  2. to the problem of determining whether a formula in predicate logic is satisfiable
  3. with respect to some theory. A theory fixes the interpretation/meaning of certain
  4. predicate and function symbols. Checking whether a formula in predicate logic is
  5. satisfiable with respect to a theory means that we are not interested in arbitrary
  6. models but in models that interpret the functions and predicates contained in
  7. the theory as defined by the axioms in the theory.