Approximate Quantifier Elimination
Date: July 19th (Friday)
Time: 16:30-16:50
Abstract
We present work in progress for developing methods for
computing quantifier-free formulas which are "approximately"
equivalent to the given quantified formulas.
The work is motivated by the observation that often
- approximate quantifier-free formulas are sufficient,
- they are often easier to compute
- they are "simpler".
The current method approximates the solution set of
the input quantified formula by "boxes"
(which is the solution set of certain linear
quantifier-free formula), via space decomposition and search.
Test results are given for applications to
stability theory, esp. in the context of control theory.
