Interval constraints: Results and perspectives

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

Volumn 1865, Issue , 2000, Pages 1-16

  Benhamou, Frédéric ^a   Granvilliers, Laurent ^a   Goualard, Frédéric ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; NUMERICAL METHODS;

ALL SOLUTIONS; ARBITRARY ACCURACY; CONSTRAINT SYSTEMS; FLOATING POINT NUMBERS; INTERVAL CONSTRAINT; LOCAL CONSISTENCY; REAL CONSTRAINTS; SCIENTIFIC COMMUNITY;

APPROXIMATION ALGORITHMS;

EID: 84940436617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44654-0_1     Document Type: Conference Paper

References (37)

1. S. Abrams and P. K. Allen. Computing camera viewpoints in an active robot workcell. Technical Report IBM Research Report: RC 20987, IBM Research Division, 1997.
2. B. D. O. Anderson, N. K. Bose, and E. I. Jury. Output feedback stabilization and related problems | solution via decision methods. IEEE Transactions onAutomatic Control, AC-20(1), 1975.
3. J. Armengol, L. Travé-Massuyès, J. Lluís de la Rosa, and J. Vehí. Envelope generation for interval systems. In M. Toro, editor, Actas del seminario sobre técnicascualitativas. VII Congreso de la Asociación Espa~nola para la Inteligencia Artificial(CAEPIA 97), pages 33-48, Málaga, 1997.
4. F. Benhamou, F. Goualard, L. Granvilliers, and J.-F. Puget. Revising hull and box consistency. In Proceedings of the sixteenth International Conference on LogicProgramming (ICLP'99), pages 230-244, Las Cruces, USA, 1999. The MIT Press. ISBN 0-262-54104-1.
5. F. Benhamou, F. Goualard, É. Languénou, and M. Christie. An algorithm to compute inner approximations for interval constraints. In Proceeding of the AndreiErshov Third International Conference on \Perspectives of System Informatics"(PSI'99), Lecture Notes in Computer Science, Novosibirsk, Akademgorodok, Russia, 1999. Springer-Verlag.
6. F. Benhamou and L. Granvilliers. Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving. Reliable Computing, 3(3):335-344, 1997.
7. F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In Proceedings of International Symposium on Logic Programming (ILPS'94), pages 1-21, Ithaca, NY, USA, 1994. MIT Press.
8. F. Benhamou and W. J. Older. Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming, 32(1):1-24, 1997.
9. J. G. Cleary. Logical Arithmetic. Future Computing Systems, 2(2):125-149, 1987.
10. H. Collavizza, F. Delobel, and M. Rueher. Comparing partial consistencies. ReliableComputing, 5:1-16, 1999.
11. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proceedings of the Second GI Conf. Automata Theory and For-mal Languages, volume 33 of Lecture Notes in Computer Science, pages 134-183, Kaiserslauten, 1975. Springer.
12. A. Colmerauer. An Introduction to Prolog III. Communications of the ACM, 33(7):69-90, 1990.
13. S. M. Drucker. Intelligent Camera Control for Graphical Environments. PhD thesis, PhD Thesis MIT Media Lab, 1994.
14. J. Garloff and B. Graf. Solving strict polynomial inequalities by bernstein expansion. In N. Munro, editor, The Use of Symbolic Methods in Control SystemAnalysis and Design, pages 339-352. The Institution of Electrical Engineers, London, England, 1999.
15. IEEE. IEEE Standard for Binary Floating-Point Arithmetic. Technical Report IEEE Std 754-1985, Institute of Electrical and Electronics Engineers, 1985. Reaf firmed 1990.
16. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proceedings 14thACM Symposium on Principles of Programming Languages (POPL'87), pages 111-119, Munich, Germany, 1987. ACM.
17. E. W. Kaucher. Interval analysis in the extended interval space IR. Computing.Supplementum, 2:33-49, 1980.
18. T. Kutsia and J. Schicho. Numerical solving of constraints of multivariate polynomial strict inequalities. Manuscript, October 1999.
19. O. Lhomme. Consistency techniques for numeric CSPs. In R. Bajcsy, editor, Proceedings of International Joint Conference on Artificial Intelligence (IJCAI'93), pages 232-238, Chambéry, France, 1993. IEEE Computer Society Press.
20. A. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99-118, 1977.
21. S. Markov. On directed interval arithmetic and its applications. Journal of Universal Computer Science, 1(7):514-526, 1995.
22. U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7(2):95-132, 1974.
23. R. E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1966.
24. E. H. Garde nes and H. Mielgo. Modal intervals: reasons and ground semantics. In Interval Mathematics, number 212 in Lecture Notes in Computer Science. SpringerVerlag, 1986.
25. W. Older and A. Vellino. Constraint Arithmetic on Real Intervals. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research. MIT Press, 1993.
26. P. Pau and J. Schicho. Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition. Technical report, Research Institute for Symbolic Computation, March 1999.
27. PrologIA. Prolog IV: Reference manual and User's guide. Technical report, 1994.
28. J.-F. Puget and P. Van Hentenryck. A constraint satisfaction approach to a circuit design problem. Journal of Global Optimization, 13:75-93, 1998.
29. H. Ratschek. Centered forms. SIAM Journal on Numerical Analysis, 17(5):656662, 1980.
30. J. Sam. Constraint Consistency Techniques for Continuous Domains. Phd. thesis, École polytechnique fédérale de Lausanne, 1995.
31. J. Sam-Haroud and B. V. Faltings. Consistency techniques for continuous constraints. Constraints, 1:85-118, 1996.
32. S. P. Shary. Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic. ReliableComputing, 2(1):3-33, 1996.
33. K. Tarabanis. Automated sensor planning and modeling for robotic vision tasks. Technical Report CUCS-045-90, University of Columbia, 1990.
34. M. H. Van Emden. Canonical extensions as common basis for interval constraints and interval arithmetic. In Proceedings of French Conference on Logic Programming and Constraint Programming (JFPLC'97), pages 71-83. HERMES, 1997.
35. P. Van Hentenryck, D. McAllester, and D. Kapur. Solving Polynomial Systems Using a Branch and Prune Approach. SIAM Journal on Numerical Analysis, 34(2), 1997.
36. P. Van Hentenryck, L. Michel, and Y. Deville. Numerica: A Modeling Languagefor Global Optimization. MIT Press, 1997.
37. A. C. Ward, T. Lozano-Pérez, and W. P. Seering. Extending the constraint propagation of intervals. In Proceedings of IJCAI'89, pages 1453-1458, 1989.