A Quantifier Elimination Algorithm for Linear Real Arithmetic

DOI10.1007/978-3-540-89439-1_18zbMath1182.68213arXiv0803.1575OpenAlexW1862725884MaRDI QIDQ5505558

David Monniaux

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.1575

Mathematics Subject Classification ID

Related Items (14)

A layered algorithm for quantifier elimination from linear modular constraints ⋮ Causality-based game solving ⋮ No Need Knowing Numerous Neighbours ⋮ Modular inference of subprogram contracts for safety checking ⋮ Verification Modulo theories ⋮ An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty ⋮ Improving Strategies via SMT Solving ⋮ Estimation of the dimensions of some Kisin varieties ⋮ Linear quantifier elimination ⋮ Linear Quantifier Elimination as an Abstract Decision Procedure ⋮ Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes ⋮ Speeding up the Constraint-Based Method in Difference Logic ⋮ A Survey of Satisfiability Modulo Theory ⋮ Solving strong controllability of temporal problems with uncertainty using SMT

This page was built for publication: A Quantifier Elimination Algorithm for Linear Real Arithmetic