Tractable fragments of Presburger arithmetic
DOI10.1007/S00224-004-1220-0zbMATH Open1090.68101OpenAlexW2004986771MaRDI QIDQ814932FDOQ814932
Authors: K. Subramani 
Publication date: 8 February 2006
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-004-1220-0
Recommendations
- Predicate logics of decidable fragments of arithmetic
- scientific article; zbMATH DE number 4010488
- Publication:4508549
- scientific article; zbMATH DE number 4031630
- Fragments of bounded arithmetic and the lengths of proofs
- A decidable fragment of predicate calculus
- Quantified propositional calculi and fragments of bounded arithmetic
- Rigid models of Presburger arithmetic
- A Decidable Fragment of Recursive Arithmetic
- Polynomially and superexponentially shorter proofs in fragments of arithmetic
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)
Cited In (6)
- Automated Reasoning
- Out of order quantifier elimination for standard quantified linear programs
- On quantified linear implications
- Polynomially and superexponentially shorter proofs in fragments of arithmetic
- On the complexity of quantified integer programming
- A complexity perspective on entailment of parameterized linear constraints
This page was built for publication: Tractable fragments of Presburger arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814932)
