Analyzing restricted fragments of the theory of linear arithmetic
type: Item
instance of: scholarly article
title: Analyzing restricted fragments of the theory of linear arithmetic
zbMATH Open document ID: 1390.68318
author: Pavlos Eirinakis
author: Piotr Wojciechowski
author: K. Subramani
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2017-03-06T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6692040
zbMATH Keywords: quantified linear programming
zbMATH Keywords: quantified linear implication
zbMATH Keywords: theory of real numbers with addition
zbMATH Keywords: complexity classes
describes a project that uses: QEPCAD
describes a project that uses: REDLOG
describes a project that uses: RSOLVER
MaRDI profile type: Publication
full work available at URL: s10472-016-9525-7
OpenAlex ID: W2521896346
cites work: Algorithms in real algebraic geometry
cites work: The complexity of logical theories
cites work: Two-Level Linear Programming
cites work: Q5310200
cites work: QEPCAD B
cites work: Resolution for quantified Boolean formulas
cites work: Real quantifier elimination is doubly exponential
cites work: Partial cylindrical algebraic decomposition for quantifier elimination
cites work: A new approach for automatic theorem proving in real geometry
cites work: Q4247790
cites work: On quantified linear implications
cites work: A Decision Procedure for the First Order Theory of Real Addition with Order
cites work: Parametric dispatching of hard real-time tasks
cites work: Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design
cites work: Q4668747
cites work: Q3050157
cites work: On a decision procedure for quantified linear programs
cites work: Efficient solving of quantified inequality constraints over the real numbers
cites work: Q3818127
cites work: Q3974991
cites work: Real addition and the polynomial hierarchy
cites work: The polynomial-time hierarchy
cites work: Q5792485
cites work: The complexity of linear problems in fields
DOI: 10.1007/S10472-016-9525-7
description: scientific article; zbMATH DE number 6692040