Elementary bounds for presburger arithmetic
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
The complexity of almost linear diophantine problems
Journal of Symbolic Computation
Complexity and uniformity of elimination in Presburger arithmetic
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On the containment and equivalence of database queries with linear constraints (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Querying Temporal Constraint Networks: A Unifying Approach
Applied Intelligence
Decision procedures for term algebras with integer constraints
Information and Computation - Special issue: Combining logical systems
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Proof Synthesis and Reflection for Linear Arithmetic
Journal of Automated Reasoning
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Ehrenfeucht--Fraïssé goes automatic for real addition
Information and Computation
Using dynamic compilation for continuing execution under reduced memory availability
Proceedings of the Conference on Design, Automation and Test in Europe
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Decision procedures for queues with integer constraints
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Verifying mixed real-integer quantifier elimination
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
The decidability of the first-order theory of knuth-bendix order
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
An algorithm for deciding BAPA: boolean algebra with presburger arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The expressivity of constraint query languages with boolean algebra linear cardinality constraints
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
On the satisfiability of modular arithmetic formulae
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Science of Computer Programming
A Perfect Model for Bounded Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This paper concerns both the complexity aspects of PA and the pragmatics of improving algorithms for dealing with restricted subcases of PA for uses such as program verification. We improve the Cooper-Presburger decision procedure and show that the improved version permits us to obtain time and space upper bounds for PA classes restricted to a bounded number of alternations of quantifiers. The improvement is one exponent less than the upper bounds for the decision problem for full PA. The pragmatists not interested in complexity bounds can read the results as substantiation of the intuitive feeling that the improvement to the Cooper-Presburger algorithm is a real, rather than ineffectual, improvement. (It can be easily shown that the bounds obtained here are not achievable using the Cooper-Presburger procedure).