Tractable fragments of Presburger arithmetic

DOI10.1007/s00224-004-1220-0zbMath1090.68101OpenAlexW2004986771MaRDI QIDQ814932

K. Subramani and Vahan Mkrtchyan

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

Mathematics Subject Classification ID

Integer programming (90C10) Applications of game theory (91A80) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Out of order quantifier elimination for standard quantified linear programs ⋮ A complexity perspective on entailment of parameterized linear constraints

This page was built for publication: Tractable fragments of Presburger arithmetic