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} }
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
Topics from this paper
21 Citations
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
- Mathematics, Computer Science
- CASC
- 2009
- 6
Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior
- Mathematics
- 2017
- 9
- PDF
Thirty Years of Virtual Substitution: Foundations, Techniques, Applications
- Mathematics, Computer Science
- ISSAC
- 2018
- 7
- PDF
Bounding quantification in parametric expansions of Presburger arithmetic
- Mathematics, Computer Science
- Arch. Math. Log.
- 2018
- 1
- Highly Influenced
- PDF
A complete and terminating approach to linear integer solving
- Mathematics, Computer Science
- J. Symb. Comput.
- 2020
References
SHOWING 1-10 OF 39 REFERENCES
Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond
- Mathematics, Computer Science
- Applicable Algebra in Engineering, Communication and Computing
- 1997
- 247
Complexity and uniformity of elimination in Presburger arithmetic
- Mathematics, Computer Science
- ISSAC
- 1997
- 40
- Highly Influential
- PDF
Simplification of Quantifier-Free Formulae over Ordered Fields
- Computer Science, Mathematics
- J. Symb. Comput.
- 1997
- 97
Applying Linear Quantifier Elimination
- Mathematics, Computer Science
- Comput. J.
- 1993
- 263
- Highly Influential
- PDF
The Complexity of Almost Linear Diophantine Problems
- Computer Science, Mathematics
- J. Symb. Comput.
- 1990
- 39