Effective Quantifier Elimination for Presburger Arithmetic with Infinity
From MaRDI portal
(Redirected from Publication:3644100)
Recommendations
Cites work
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 3550662 (Why is no real title available?)
- scientific article; zbMATH DE number 3408928 (Why is no real title available?)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Advances in Databases and Information Systems
- Applying Linear Quantifier Elimination
- Automated Deduction – CADE-20
- Deciding Boolean algebra with Presburger arithmetic
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
- Linear problems in valued fields
- Presburger arithmetic with bounded quantifier alternation
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Simplification of quantifier-free formulae over ordered fields
- Simulation and optimization by quantifier elimination
- The complexity of almost linear diophantine problems
- The complexity of linear problems in fields
- The computational complexity of logical theories
- Weak Integer Quantifier Elimination Beyond the Linear Case
- Weak quantifier elimination for the full linear theory of the integers
Cited in
(6)- Quantifier elimination for counting extensions of Presburger arithmetic
- Presburger arithmetic with bounded quantifier alternation
- On Presburger arithmetic extended with modulo counting quantifiers
- Decidable (ac)counting with Parikh and Muller: adding Presburger arithmetic to monadic second-order logic over tree-interpretable structures
- Linear quantifier elimination as an abstract decision procedure
- Certified reasoning with infinity
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)
