Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
sav08:qe_for_presburger_arithmetic [2009/04/23 14:51] vkuncak |
sav08:qe_for_presburger_arithmetic [2012/03/09 10:44] vkuncak |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| We consider elimination of a quantifier from a conjunction of literals (because [[QE from Conjunction of Literals Suffices]]). | We consider elimination of a quantifier from a conjunction of literals (because [[QE from Conjunction of Literals Suffices]]). | ||
| + | Running example: | ||
| + | \[ | ||
| + | \exists y. 3 y - 2 x + 1 > - x \land 2y - 6 < z \land 4 \mid 5y + 1 | ||
| + | \] | ||
| ===== Normalizing Conjunctions of Literals ===== | ===== Normalizing Conjunctions of Literals ===== | ||
| Line 32: | Line 35: | ||
| We obtain a disjunction of conjunctions of literals of the form $0 < t$ and $K \mid t$ where $t$ are of the form $K_0 + \sum_{i=1}^n K_i \cdot x_i$ | We obtain a disjunction of conjunctions of literals of the form $0 < t$ and $K \mid t$ where $t$ are of the form $K_0 + \sum_{i=1}^n K_i \cdot x_i$ | ||
| - | |||
| - | |||
| - | |||
| ===== Exposing the Variable to Eliminate ===== | ===== Exposing the Variable to Eliminate ===== | ||