Effective Quantifier Elimination for Presburger Arithmetic with Infinity
DOI10.1007/978-3-642-04103-7_18zbMATH Open1260.68482OpenAlexW1851760673MaRDI QIDQ3644100FDOQ3644100
Publication date: 10 November 2009
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_18
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) First-order arithmetic and fragments (03F30) Quantifier elimination, model completeness, and related topics (03C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- The complexity of linear problems in fields
- Simplification of quantifier-free formulae over ordered fields
- Weak Integer Quantifier Elimination Beyond the Linear Case
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Weak quantifier elimination for the full linear theory of the integers
- Simulation and optimization by quantifier elimination
- Applying Linear Quantifier Elimination
- The computational complexity of logical theories
- Automated Deduction – CADE-20
- Presburger arithmetic with bounded quantifier alternation
- Deciding Boolean algebra with Presburger arithmetic
- The complexity of almost linear diophantine problems
- Advances in Databases and Information Systems
- Linear problems in valued fields
Cited In (2)
Uses Software
This page was built for publication: Effective Quantifier Elimination for Presburger Arithmetic with Infinity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644100)
