Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
sav08:qe_for_presburger_arithmetic [2009/04/23 09:44] vkuncak |
sav08:qe_for_presburger_arithmetic [2009/04/23 09:57] vkuncak |
||
|---|---|---|---|
| Line 131: | Line 131: | ||
| $\exists res, i. \neg true$\\ | $\exists res, i. \neg true$\\ | ||
| $false$ | $false$ | ||
| + | |||
| + | |||
| ===== Some Improvements ===== | ===== Some Improvements ===== | ||
| Avoid transforming to conjunctions of literals: work directly on negation-normal form. | Avoid transforming to conjunctions of literals: work directly on negation-normal form. | ||
| + | * the technique is similar to what we described for conjunctive normal form | ||
| - | See Section 7.2 of the [[Calculus of Computation Textbook]]. | + | This is the Cooper's algorithm |
| + | * {{sav09:reddyloveland78presburgerboundedalternation.pdf|Reddy, Loveland: Presburger Arithmetic with Bounded Quantifier Alternation}} (gives a slight improvement of the original Cooper's algorithm) | ||
| + | * Section 7.2 of the [[Calculus of Computation Textbook]] | ||
| ===== References ===== | ===== References ===== | ||