When interval analysis helps inter-block backtracking

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

Volumn 4204 LNCS, Issue , 2006, Pages 390-405

  Neveu, Bertrand ^a   Chabert, Gilles ^a   Trombettoni, Gilles ^a  

^a INRIA   (France)

Author keywords

Decomposition; Intervals; Solving sparse systems

Indexed keywords

ALGORITHMS; BENCHMARKING; LIBRARIES; MATHEMATICAL OPERATORS; NONLINEAR EQUATIONS;

INTER-BLOCK BACKTRACKING (IBB); INTERVALS; SPARSE SYSTEMS SOLVING; SUB-SYSTEMS;

COMPUTATION THEORY;

EID: 33750363780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_29     Document Type: Conference Paper

References (23)

1. F. Benhamou, F. Goualard, L. Granvilliers, and J-F. Puget. Revising Hull and Box Consistency. In ICLP, pages 230-244, 1999.
2. C. Bliek, B. Neveu, and G. Trombettoni. Using Graph Decomposition for Solving Continuous CSPs. In Proc. CP'98, LNCS 1520, pages 102-116, 1998.
3. W. Bouma, I. Fudos, C.M. Hoffmann, J. Cai, and R. Paige. Geometric constraint solver. Computer Aided Design, 27(6):487-501, 1995.
4. G. Chabert. Contributions à la résolution de Contraintes sur intervalles? Phd thesis, Université de Nice-Sophia Antipolis, 2006. (to be defended).
5. R. Debruyne and C. Bessière. Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In Proc. of IJCAI, pages 412-417, 1997.
6. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41(3):273-312, 1990.
7. L. Granvilliers. RealPaver User's Manual, version 0.3. University of Nantes, 2003. Available at www.sciences.univ-nantes.fr/info/perso/permanents/ granvil/realpaver.
8. L. Granvilliers. Realpaver: An interval solver using constraint satisfaction techniques. ACM Transactions on Mathematical Software, Accepted for publication.
9. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: A Modeling Language for Global Optimization. MIT Press, 1997.
10. C. Hoffmann, A. Lomonossov, and M. Sitharam. Finding solvable subsets of constraint graphs. In Proc. Constraint Programming CP'97, pages 463-477, 1997.
11. ILOG, Av. Galliéni, Gent illy. Hog Solver V. 5, Users' Reference Manual, 2000.
12. L. Jaulin, M. Kieffer, O. Didrit, and E. Walter. Applied Interval Analysis. Springer-Verlag, 2001.
13. C. Jermann, B. Neveu, and G. Trombettoni. Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems. In Proc. IJCAI, pages 233-38, 2003.
14. nd Int. Workshop on Global Constrained Optimization and Constraint Satisfaction (COCOS'03), 2003.
15. C. Jermann, G. Trombettoni, B. Neveu, and P. Mathis. Decomposition of Geometric Constraint Systems: a Survey. Int. Journal of Computational Geometry and Applications (IJCGA), 16, 2006.
16. R.S. Latham and A.B. Middleditch. Connectivity analysis: A tool for processing geometric constraints. Computer Aided Design, 28(11):917-928, 1996.
17. Y. Lebbah. Contribution à la résolution de Contraintes par Consistance Forte. Phd thesis, Université de Nantes, 1999.
18. Y. Lebbah, C. Michel, M. Rueher, D. Daney, and J.P. Merlet. Efficient and safe global constraints for handling numerical constraint systems. SIAM Journal on Numerical Analysis, 42(5):2076-2097, 2005.
19. O. Lhomme. Consistency Tech. for Numeric CSPs. In IJCAI, pages 232-238, 1993.
20. D.A. McAllester. Partial order backtracking. Research Note, Artificial Intelligence Laboratory, MIT, 1993. ftp://ftp.ai.mit.edu/people/dam/dynamic.ps.
21. Jean-Pierre Merlet. Optimal design for the micro robot. In IEEE Int. Conf. on Robotics and Automation, 2002.
22. A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, 1990.
23. M. Wilczkowiak, G. Trombettoni, C. Jermann, P. Sturm, and E. Boyer. Scene Modeling Based on Constraint System Decomposition Tech. In Proc. ICCV, 2003.