Weak quantifier elimination for the full linear theory of the integers

@article{Lasaruk2007WeakQE,
  title={Weak quantifier elimination for the full linear theory of the integers},
  author={Aless Lasaruk and T. Sturm},
  journal={Applicable Algebra in Engineering, Communication and Computing},
  year={2007},
  volume={18},
  pages={545-574}
}
  • Aless Lasaruk, T. Sturm
  • Published 2007
  • Computer Science, Mathematics
  • Applicable Algebra in Engineering, Communication and Computing
We describe a weak quantifier elimination procedure for the full linear theory of the integers. This theory is a generalization of Presburger arithmetic, where the coefficients are arbitrary polynomials in non-quantified variables. The notion of weak quantifier elimination refers to the fact that the result possibly contains bounded quantifiers. For fixed choices of parameters these bounded quantifiers can be expanded into disjunctions or conjunctions. We furthermore give a corresponding… Expand
21 Citations
Weak Integer Quantifier Elimination Beyond the Linear Case
  • 7
  • PDF
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
  • 6
Better Answers to Real Questions
  • 9
  • PDF
New Domains for Applied Quantifier Elimination
  • 24
Thirty Years of Virtual Substitution: Foundations, Techniques, Applications
  • T. Sturm
  • Mathematics, Computer Science
  • ISSAC
  • 2018
  • 7
  • PDF
Bounding quantification in parametric expansions of Presburger arithmetic
  • J. Goodrick
  • Mathematics, Computer Science
  • Arch. Math. Log.
  • 2018
  • 1
  • Highly Influenced
  • PDF
A complete and terminating approach to linear integer solving
Linear Integer Arithmetic Revisited
  • 15
  • PDF
...
1
2
3
...

References

SHOWING 1-10 OF 39 REFERENCES
Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond
  • V. Weispfenning
  • Mathematics, Computer Science
  • Applicable Algebra in Engineering, Communication and Computing
  • 1997
  • 247
Complexity and uniformity of elimination in Presburger arithmetic
  • 40
  • Highly Influential
  • PDF
Simplification of Quantifier-Free Formulae over Ordered Fields
  • 97
Applying Linear Quantifier Elimination
  • 263
  • Highly Influential
  • PDF
The Complexity of Almost Linear Diophantine Problems
  • 39
Boolean Quantification in a First-Order Context
  • 16
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
  • 392
Generalized Constraint Solving over Dierential Algebras
  • 3
The Complexity of Linear Problems in Fields
  • 286
...
1
2
3
4
...