Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
sav07_lecture_3_skeleton [2007/03/21 10:15] vkuncak |
sav07_lecture_3_skeleton [2007/03/21 10:17] vkuncak |
||
---|---|---|---|
Line 150: | Line 150: | ||
Proof: small model theorem. | Proof: small model theorem. | ||
+ | |||
Line 175: | Line 176: | ||
* solution of Ax=b (A regular) has as components rationals of form p/q with bounded p,q | * solution of Ax=b (A regular) has as components rationals of form p/q with bounded p,q | ||
* duality of linear programming | * duality of linear programming | ||
- | * obtains bound $M = n(ma)^{2m+1}$. | + | * obtains bound $M = n(ma)^{2m+1}$, which needs $(2m+1)(\log n + \log m + \log a)$ bits |
+ | * we could encode the problem into SAT: use circuits for addition, comparison etc. | ||
+ | |||
+ | Note: if small model theorem applies to conjunctions, it also applies to arbitrary QFPA formulas. | ||
- | Note: if small model theorem applies to conjunctions, it also applies to arbitrary QFPA formulas. Moreover, one can improve these bounds. One tool based on these ideas is [[http://www.cs.cmu.edu/~uclid/|UCLID]]. | + | Moreover, one can improve these bounds. One tool based on these ideas is [[http://www.cs.cmu.edu/~uclid/|UCLID]]. |
Alternative: enumerate disjuncts of DNF on demand, each disjunct is a conjunction, then use ILP techniques (often first solve the underlying linear programming problem over reals). Most SMT tools are based on this idea (along with Nelson-Oppen combination: next class). | Alternative: enumerate disjuncts of DNF on demand, each disjunct is a conjunction, then use ILP techniques (often first solve the underlying linear programming problem over reals). Most SMT tools are based on this idea (along with Nelson-Oppen combination: next class). |