|
|
|
|
|
|
by OxO4
2689 days ago
|
|
|
That actually depends on the logic being used. Some of the logics supported by Z3 are not even decidable. In fact, even solving quantifier-free bit-vector formulas is NEXPTIME-complete [0] when using a binary encoding. [0] http://smt2012.loria.fr/paper7.pdf |
|
|
What do Z3 and other SMT solvers do if you ask them about undecidable questions? Do they potentially run forever?