Analyzing restricted fragments of the theory of linear arithmetic

DOI10.1007/s10472-016-9525-7zbMath1390.68318OpenAlexW2521896346MaRDI QIDQ513354

Pavlos Eirinakis, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan

Publication date: 6 March 2017

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

Full work available at URL: https://doi.org/10.1007/s10472-016-9525-7

zbMATH Keywords

complexity classestheory of real numbers with additionquantified linear implicationquantified linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Uses Software

• QEPCAD
• REDLOG
• RSOLVER

Cites Work

• Real addition and the polynomial hierarchy
• The complexity of linear problems in fields
• Real quantifier elimination is doubly exponential
• The complexity of logical theories
• Partial cylindrical algebraic decomposition for quantifier elimination
• The polynomial-time hierarchy
• A new approach for automatic theorem proving in real geometry
• Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design
• Resolution for quantified Boolean formulas
• On quantified linear implications
• On a decision procedure for quantified linear programs
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Parametric dispatching of hard real-time tasks
• QEPCAD B
• Two-Level Linear Programming
• Efficient solving of quantified inequality constraints over the real numbers
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing restricted fragments of the theory of linear arithmetic