Continuous first-order constraint satisfaction

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

Volumn 2385, Issue , 2002, Pages 181-195

  Ratschan, Stefan ^a  

^a UNIVERSITY OF GIRONA   (Spain)

Author keywords

Constraint programming; Reasoning

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY;

CONSTRAINT PROGRAMMING; FIRST ORDER; REAL NUMBER; REASONING;

COMPUTER PROGRAMMING;

EID: 77958522622     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45470-5     Document Type: Conference Paper

References (33)

1. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. In S. Goldwasser, editor, Proceedings fo the 35th Annual Symposium on Foundations of Computer Science, pages 632–641, Los Alamitos, CA, USA, 1994. IEEE Computer Society Press.
2. F. Benhamou. Interval constraint logic programming. In Podelski [21].
3. 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.
4. F. Benhamou, F. Goualard, L. Granvilliers, and J. F. Puget. Revising hull and box consistency. In Int. Conf. on Logic Programming, pages 230–244, 1999.
5. 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.
6. F. Benhamou and W. J. Older. Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming, 32(1):1–24, 1997.
7. B. F. Caviness and J. R. Johnson, editors. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, 1998.
8. G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Second GI Conf. Automata Theory and Formal Languages, volume 33 of LNCS, pages 134–183. Springer Verlag, 1975. Also in [7].
9. G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12:299–328, 1991. Also in [7].
10. J. H. Davenport and J. Heintz. Real quantifier elimination is doubly exponential. Journal of Symbolic Computation, 5:29–35, 1988.
11. L. Granvilliers. A symbolic-numerical branch and prune algorithm for solving nonlinear polynomial systems. Journal of Universal Computer Science, 4(2):125–146, 1998.
12. P. V. Hentenryck, D. McAllester, and D. Kapur. Solving polynomial systems using a branch and prune approach. SIAM Journal on Numerical Analysis, 34(2), 1997.
13. P. V. Hentenryck, V. Saraswat, and Y. Deville. The design, implementation, and evaluation of the constraint language cc(FD). In Podelski [21].
14. H. Hong and V. Stahl. Safe starting regions by fixed points and tightening. Computing, 53:323–335, 1994.
15. L. Jaulin and É. Walter. Guaranteed tuning, with application to robust control and motion planning. Automatica, 32(8):1217–1221, 1996.
16. J. Jourdan and T. Sola. The versatility of handling disjunctions as constraints. In M. Bruynooghe and J. Penjam, editors, Proc. of the 5th Intl. Symp. on Programming Language Implementation and Logic Programming, PLILP’93, number 714 in LNCS, pages 60–74. Springer Verlag, 1993.
17. A. Macintyre and A. Wilkie. On the decidability of the real exponential field. In P. Odifreddi, editor, Kreiseliana—About and Around Georg Kreisel, pages 441–467. A K Peters, 1996.
18. S. Malan, M. Milanese, and M. Taragna. Robust analysis and design of control systems using interval arithmetic. Automatica, 33(7):1363–1372, 1997.
19. K. Marriott, P. Moulder, P. J. Stuckey, and A. Borning. Solving disjunctive constraints for interactive graphical applications. In Seventh Intl. Conf. on Principles and Practice of Constraint Programming-CP2001, number 2239 in LNCS, pages 361–376. Springer, 2001.
20. A. Neumaier. Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, 1990.
21. A. Podelski, editor. Constraint Programming: Basics and Trends, volume 910 of LNCS. Springer Verlag, 1995.
22. S. Ratschan. Approximate quantified constraint solving (AQCS). http://www. risc. uni-linz. ac. at/research/software/AQCS, 2000. Software package.
23. S. Ratschan. Applications of real first-order constraint solving — bibliography. http://www. risc. uni-linz. ac. at/people/sratscha/appFOC. html, 2001.
24. S. Ratschan. Real first-order constraints are stable with probability one. http://www. risc. uni-linz. ac. at/people/sratscha, 2001. Draft.
25. S. Ratschan. Approximate quantified constraint solving by cylindrical box decomposition. Reliable Computing, 8(1):21–42, 2002.
26. S. Ratschan. Quantified constraints under perturbations. Journal of Symbolic Computation, 33(4):493–505, 2002.
27. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13(3):255–352, March 1992.
28. D. Richardson. Some undecidable problems involving elementary functions of a real variable. Journal of Symbolic Logic, 33:514–520, 1968.
29. D. Sam-Haroud and B. Faltings. Consistency techniques for continuous constraints. Constraints, 1(1/2):85–118, September 1996.
30. S. P. Shary. Outer estimation of generalized solution sets to interval linear systems. Reliable Computing, 5:323–335, 1999.
31. A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, 1951. Also in [7].
32. L. van den Dries. Alfred Tarski’s elimination theory for real closed fields. Journal of Symbolic Logic, 53(1):7–19, 1988.
33. V. Weispfenning. The complexity of linear problems in fields. Journal of Symbolic Computation, 5(1–2):3–27, 1988.