Solving existentially quantified constraints with one equality and arbitrarily many inequalities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 615-633

  Ratschan, Stefan ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CONSTRAINT PROPAGATION ALGORITHMS; CONTROL ENGINEERING; EXISTENTIALLY QUANTIFIED CONSTRAINTS; FREE VARIABLE; WELL-POSED PROBLEMS;

ALGORITHMS;

EID: 35248867777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_42     Document Type: Article

References (33)

1. F. Benhamou and F. Goualard. Universally quantified interval constraints. In Proc. of the Sixth Intl. Conf. on Principles and Practice of Constraint Programming (CP'2000), number 1894 in LNCS, Singapore, 2000. Springer Verlag.
2. F. Benhamou, D. McAllester, and P. V. Hentenryck. CLP (Intervals) Revisited. In International Symposium on Logic Programming, pages 124-138, Ithaca, NY, USA, 1994. MIT Press.
3. F. Benhamou and W. J. Older. Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming, 32(1):1-24, 1997.
4. L. Bordeaux and E. Monfroy. Beyond NP: Arc-consistency for quantified constraints. In P. V. Hentenryck, editor, Proc. of Principles and Practice of Constraint Programming (CP 2002), number 2470 in LNCS. Springer, 2002.
5. B. F. Caviness and J. R. Johnson, editors. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Wien, 1998.
6. G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Caviness and Johnson [5], pages 134-183.
7. J. H. Davenport and J. Heintz. Real quantifier elimination is doubly exponential. Journal of Symbolic Computation, 5:29-35, 1988.
8. E. Davis. Constraint propagation with interval labels. Artificial Intelligence, 32(3):281-331, 1987.
9. E. Garden̄es, M. Á. Sainz, L. Jorba, R. Calm, R. Estela, H. Mielgo, and A. Trepat. Modal intervals. Reliable Computing, 7(2):77-111, 2001.
10. L. Granvilliers. On the combination of interval constraint solvers. Reliable Computing, 7(6):467-483, 2001.
11. T. J. Hickey. smathlib. http://interval.sourceforge.net/interval/C/ smathlib/README.html.
12. T. J. Hickey, Q. Ju, and M. H. van Emden. Interval arithmetic: from principles to implementation. Journal of the ACM, 48(5):1038-1068, 2001.
13. H. Hong. Improvements in CAD-based Quantifier Elimination. PhD thesis, The Ohio State University, 1990.
14. L. Jaulin, M. Kieffer, O. Didrit, and E. Walter. Applied Interval Analysis, with Examples in Parameter and State Estimation, Robust Control and Robotics. Springer, Berlin, 2001.
15. L. Jaulin and E. Walter. Guaranteed nonlinear parameter estimation from boundedor data via interval analysis. Mathematics and Computers in Simulation, 35(2):123-137, 1993.
16. R. Loos and V. Weispfenning. Applying linear quantifier elimination. The Computer Journal, 36(5):450-462, 1993.
17. G. Mayer. Epsilon-inflation in verification algorithms. Journal of Computational and Applied Mathematics, 60:147-169, 1994.
18. M. Milanese and A. Vicino. Estimation theory for nonlinear models and set membership uncertainty. Automatica (Journal of IFAC), 27(2):403-408, 1991.
19. A. Neumaier. Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, 1990.
20. N. S. Nise. Control Systems Engineering. John Wiley & Sons, 3rd edition, 2000.
21. J. M. Ortega and W. C. Rheinboldt. Iterative Solution of Nonlinear Equations. Academic Press, 1970.
22. S. Ratschan. Applications of quantified constraint solving over the reals - bibliography. http://www.mpi-sb.mpg.de/~ratschan/appqcs.html, 2001.
23. S. Ratschan. Continuous first-order constraint satisfaction. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning, and Symbolic Computation, number 2385 in LNCS, pages 181-195. Springer, 2002.
24. S. Ratschan. Continuous first-order constraint satisfaction with equality and disequality constraints. In P. van Hentenryck, editor, Proc. 8th International Conference on Principles and Practice of Constraint Programming, number 2470 in LNCS, pages 680-685. Springer, 2002.
25. S. Ratschan. Efficient solving of quantified inequality constraints over the real numbers. http://www.mpi-sb.mpg.de/~ratschan/preprints.html, 2002. submitted for publication.
26. S. Ratschan. Quantified constraints under perturbations. Journal of Symbolic Computation, 33(4):493-505, 2002.
27. S. M. Rump. A note on epsilon-inflation. Reliable Computing, 4:371-375, 1998.
28. S. P. Shary. A new technique in systems analysis under interval uncertainty and ambiguity. Reliable Computing, 8:321-418, 2002.
29. A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, 1951. Also in [5].
30. T. Walsh. Stochastic constraint programming. In Proc. of ECAI, 2002.
31. E. Walter and L. Pronzato. Identification of Parametric Models from Experimental Data. Springer, 1997.
32. V. Weispfenning. The complexity of linear problems in fields. Journal of Symbolic Computation, 5(1-2):3-27, 1988.
33. N. Yorke-Smith and C. Gervet. On constraint problems with incomplete or erroneous data. In P. V. Hentenryck, editor, Principles and Practice of Constraint Programming, number 2470 in LNCS, pages 732-737, 2002.