Approximate quantified constraint solving by cylindrical box decomposition

DOI10.1023/A:1014785518570zbMath0997.65077MaRDI QIDQ1604710

Stefan Ratschan

Publication date: 8 July 2002

Published in: Reliable Computing (Search for Journal in Brave)

zbMATH Keywords

approximation methodinterval arithmeticcomputer algebrainterval methodscylindrical decompositionfirst-order formula

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Decidability of theories and sets of sentences (03B25)

Related Items (7)

Computer algebra for guaranteed accuracy. How does it help? ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ Inner and outer characterization of the projection of polynomial equations using symmetries, quotients and intervals ⋮ Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination ⋮ Bracketing backward reach sets of a dynamical system ⋮ Efficient handling of universally quantified inequalities ⋮ Quantified constraints under perturbation

Uses Software

• QEPCAD
• AQCS

This page was built for publication: Approximate quantified constraint solving by cylindrical box decomposition