Out of order quantifier elimination for standard quantified linear programs

DOI10.1016/J.JSC.2005.08.001MaRDI QIDQ2456614zbMATH OpenOpenAlexFDO

Authors D. Desovski, K. Subramani

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

constraint logic programmingquantifier eliminationout of orderquantified linear programs

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Mechanization of proofs and logical operations (03B35) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• On a decision procedure for quantified linear programs
• Computer Algebra in Scientific Computing
• scientific article; zbMATH DE number 2040956
• A Quantifier Elimination Algorithm for Linear Real Arithmetic
• Applying Linear Quantifier Elimination

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 3501006 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 2040956 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• An analysis of partially Clairvoyant scheduling
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• New results on quantifier elimination over real closed fields and applications to constraint databases
• 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
• Parametric dispatching of hard real-time tasks
• Properties of Programs and the First-Order Predicate Calculus
• Resolution for quantified Boolean formulas
• The complexity theory companion
• Tractable fragments of Presburger arithmetic

Cited in

(3)

• Computer Algebra in Scientific Computing
• On a decision procedure for quantified linear programs
• An empirical analysis of algorithms for partially Clairvoyant scheduling

This page was built for publication: Out of order quantifier elimination for standard quantified linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456614)