Short Presburger arithmetic is hard

08/28/2017
by   Danny Nguyen, et al.
0

We study the computational complexity of short sentences in Presburger arithmetic (Short-PA). Here by "short" we mean sentences with a bounded number of variables, quantifiers, inequalities and Boolean operations; the input consists only of the integer coefficients involved in the linear inequalities. We prove that satisfiability of Short-PA sentences with m+2 alternating quantifiers is Σ_P^m-complete or Π_P^m-complete, when the first quantifier is ∃ or ∀, respectively. Counting versions and restricted systems are also analyzed. Further application are given to hardness of two natural problems in Integer Optimizations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2021

Complexity of the Ackermann fragment with one leading existential quantifier

In this short note we prove that the satisfiability problem of the Acker...
research
05/09/2018

Presburger Arithmetic with algebraic scalar multiplications

We study complexity of integer sentences in S_α = (R, <, +,Z, x α x), wh...
research
03/08/2018

On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)

We investigate the complexity consequences of adding pointer arithmetic ...
research
01/24/2022

A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

In a previous paper, we have shown that clause sets belonging to the Hor...
research
04/26/2020

Monadic Decomposition in Integer Linear Arithmetic (Technical Report)

Monadic decomposability is a notion of variable independence, which asks...
research
04/14/2023

Operations on Fixpoint Equation Systems

We study operations on fixpoint equation systems (FES) over arbitrary co...
research
03/31/2022

Decidability bounds for Presburger arithmetic extended by sine

We consider Presburger arithmetic extended by the sine function, call th...

Please sign up or login with your details

Forgot password? Click here to reset