Out of order quantifier elimination for standard quantified linear programs

DOI10.1016/j.jsc.2005.08.001zbMath1125.68142MaRDI QIDQ2456614

D. Desovski, K. Subramani and Vahan Mkrtchyan

Publication date: 19 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2005.08.001

zbMATH Keywords

quantifier elimination; constraint logic programming; out of order; quantified linear programs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

90C05: Linear programming

03B35: Mechanization of proofs and logical operations

03C10: Quantifier elimination, model completeness, and related topics

Related Items

An empirical analysis of algorithms for partially Clairvoyant scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tractable fragments of Presburger arithmetic
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• An analysis of partially Clairvoyant scheduling
• Resolution for quantified Boolean formulas
• New results on quantifier elimination over real closed fields and applications to constraint databases
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Parametric dispatching of hard real-time tasks
• Properties of Programs and the First-Order Predicate Calculus
• The complexity theory companion