Similar Items: Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- Decidability of extensions of Presburger arithmetic by generalised polynomials
- On Presburger arithmetic extended with non-unary counting quantifiers
- Bounded Reachability Problems are Decidable in FIFO Machines
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- The parameterized space complexity of model-checking bounded variable first-order logic
- Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable