Approximate quantified constraint solving by cylindrical box decomposition

Reliable Computing

Volumn 8, Issue 1, 2002, Pages 21-42

  Ratschan, Stefan ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; PROBLEM SOLVING;

CYLINDRICAL BOX DECOMPOSITION;

COMPUTATIONAL METHODS;

EID: 0036466248     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014785518570     Document Type: Article

References (57)

1. Deciding linear-trigonometric problems
2. Cylindrical algebraic decomposition I: The basic algorithm
3. Algorithms that still produce a solution (Maybe Not Optimal) even when interrupted: Shary's idea justified
4. Universally quantified interval constraints
5. Simple CAD construction and its applications
6. Quantifier elimination and cylindrical algebraic decomposition
7. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition
8. Partial cylindrical algebraic decomposition for quantifier elimination
9. A hybrid method for high precision calculation of polynomial real roots
10. Quantified multivariate polynomial inequalities
11. Robust multi-objective feedback design by quantifier elimination
12. A new approach to rectangle intersections I, II
13. Regularization methods for the stable solution of inverse problems
14. Robust performance design of fixed structure controllers with uncertain parameters
15. Modal intervals: Reason and ground semantics
16. Modal intervals
17. Solving strict polynomial inequalities by bernstein expansion
18. Reasoning about computational resource allocation-an introduction to anytime algorithms
19. Nonlinear equations in one variable
20. Heuristic search and pruning in polynomial constraints satisfaction
21. Heuristic search strategies for cylindrical algebraic decomposition
22. Quantifier elimination for formulas constrained by quadratic equations via slope resultants
23. Symbolic-numeric methods for quantified constraint solving
24. The exact region of stability for MacCormack scheme
25. Testing stability by quantifier elimination
26. Approximate quantifier elimination
27. Safe starting regions by fixed points and tightening
28. Guaranteed tuning, with application to robust control and motion planning
29. Nonlinear control system design by quantifier elimination
30. Real algebraic number computation using interval arithmetic
31. Robust analysis and design of control systems using interval arithmetic
32. Solving polynomial strict inequalities using cylindrical algebraic decomposition
33. Parameter sets for bounded-error data
34. Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition
35. Uncertainty propagation in heterogeneous algebras for approximate quantified constraint solving
36. Some undecidable problems involving elementary functions of a real variable
37. Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of kaucher arithmetic
38. On optimal solution of interval linear equations
39. Outer estimation of generalized solution sets to interval linear systems
40. The complexity of linear problems in fields
41. Approximate reasoning using anytime algorithms