On quantified linear implications

DOI10.1007/S10472-013-9332-3MaRDI QIDQ2254606zbMATH OpenOpenAlexFDO

Authors Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski

Publication date 5 February 2015

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-013-9332-3

zbMATH Keywords

computational complexitypolynomial hierarchylinear constraintsquantified linear implicationinclusion query over polyhedral sets

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• On a decision procedure for quantified linear programs
• scientific article; zbMATH DE number 2040956
• Polyhedral and algorithmic properties of quantified linear programs
• Automated Reasoning
• Tractable fragments of Presburger arithmetic

Cites work

• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1302474 (Why is no real title available?)
• scientific article; zbMATH DE number 1158761 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A complexity perspective on entailment of parameterized linear constraints
• Alfred Tarski's elimination theory for real closed fields
• An analysis of partially Clairvoyant scheduling
• An analysis of totally clairvoyant scheduling
• Computational complexity of parametric linear programming
• Efficient solving of quantified inequality constraints over the real numbers
• Geometric algorithm for multiparametric linear programming
• On a decision procedure for quantified linear programs
• On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
• QEPCAD B
• Real quantifier elimination is doubly exponential
• Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design
• The complexity of linear problems in fields
• The polynomial-time hierarchy
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Types and programing languages
• Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs

Cited in

(7)

• Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
• Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
• scientific article; zbMATH DE number 2040956 (Why is no real title available?)
• scientific article; zbMATH DE number 6027088 (Why is no real title available?)
• Linear concepts and hidden variables
• Analyzing restricted fragments of the theory of linear arithmetic
• On a decision procedure for quantified linear programs

Describes a project that uses

Uses Software

• QEPCAD
• REDLOG
• RSOLVER

This page was built for publication: On quantified linear implications

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