G. Alefeld and J. Hertzberger, Introduction to Interval Computation, 1983.

H. Batnini, Contraintes globales pour la résolution de contraintes de distance, 2002.

H. Batnini, Introduction of redundant constraints for solving distance constraints systems Journal of the university of Saärbrück, CALCULEMUS autumn school : Student poster abstracts, pp.19-23, 2002.

H. Batnini, C. Michel, and M. Rueher, Mind the Gaps: A New Splitting Strategy for Consistency Techniques, CP, pp.77-91, 2005.
DOI : 10.1007/11564751_9

H. Batnini and M. Rueher, Filtrage local par décomposition de csp continus, Actes JNPC'03. 9eme Journées Nationales pour la résolution deProbì emes NP-complets, pp.39-51, 2003.

H. Batnini and M. Rueher, Semantic Decomposition for Solving Distance Constraints, Proc. of CP'03 : 9th International Conference on " Principles and Practice of Constraint Programming " ), LNCS 2833, pp.964-964, 2003.
DOI : 10.1007/978-3-540-45193-8_89

H. Batnini and M. Rueher, Décomposition sémantique pour la résolution de systèmes d'´ equations de distances, JEDAI(Journal Electronique d'Intelligence Artificielle), 2003.

H. Batnini and M. Rueher, Quaddist : Filtrage global pour les contraintes de distance, Actes JNPC'04(10èmes Journées Nationales pour la résolution pratique deProbì emes NP-complets), pp.59-71, 2004.

H. Batnini, M. Rueher, and C. Michel, Une stratégie de résolution orientée par la topologie des csp numériques, Actes JFPC'05 (1` eres Journées Francophones de Programmation par Contraintes), pp.199-210, 2005.

N. Beldiceanu, M. Carlsson, and J. Rampon, Tr2005-06 : global constraint catalog, 2005.

N. Beldiceanu, M. Carlsson, J. Rampon, and C. Truchet, Graph Invariants as Necessary Conditions for Global Constraints, Proc. of CP'05 : 11th International Conference on " Principles and Practice of Constraint Programming " ), LNCS 3709, pp.92-106, 2005.
DOI : 10.1007/11564751_10

N. Beldiceanu and E. Contjean, Introducing global constraints in CHIP, Mathematical and Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
DOI : 10.1016/0895-7177(94)90127-9
URL : https://hal.archives-ouvertes.fr/hal-00442810

F. Benhamou, F. Goualard, L. Granvilliers, and J. F. Puget, Revising hull and box consistency, International Conference on Logic Programming, pp.230-244, 1999.

F. Benhamou, D. Mcallister, and P. Van-hentenryck, CLP(intervals) revisited, Proceedings of the 1994 International Symposium, pp.124-138, 1994.

F. Benhamou and W. Older, Applying interval arithmetic to real, integer, and boolean constraints, The Journal of Logic Programming, vol.32, issue.1, pp.1-24, 1997.
DOI : 10.1016/S0743-1066(96)00142-2
URL : http://doi.org/10.1016/s0743-1066(96)00142-2

C. Bessì-ere, Arc-consistency and arc-consistency again, Artificial Intelligence, vol.65, issue.1, pp.179-190, 1994.
DOI : 10.1016/0004-3702(94)90041-8

C. Bessì-ere and J. Régin, Enforcing arc consistency on global constraints by solving subproblems on the fly, PPCP, pp.103-117, 1999.

J. R. Bitner and E. M. Reingold, Backtrack programming techniques, Communications of the ACM, vol.18, issue.11, pp.651-656, 1975.
DOI : 10.1145/361219.361224

C. Bliek, B. Neveu, and G. Trombettoni, Using Graph Decomposition for Solving Continuous CSPs, Proc. of CP'98 : 4th International Conference on " Principles and Practice of Constraint Programming, pp.102-116, 1998.
DOI : 10.1007/3-540-49481-2_9

L. M. Blumenthal, Theory and Application of Distance Geometry, 1953.

L. Bordeaux, E. Monfroy, and F. Benhamou, Raisonnement sur les propriétés de contraintes numériques, Programmation en logique par contrainte, pp.13-26, 2002.

H. Brönninmann and S. Pion, Exact rounding for geometric constructions, Proc. of International symposium on Scientific Computing, 1997.

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, 1965.

B. Buchberger, Gröbner bases : an algorithmic method in polynomial ideal theory, Recent trends in multidimensional system theory, 1985.

M. Ceberio, ContributionàContribution`Contributionà l'´ etude des CSPs numériques sous et sur-contraints. Outils symboliques et contraintes flexibles continues, 2003.

H. Collavizza, F. Delobel, and M. Rueher, A Note on Partial Consistencies over Continuous Domains, Proc. of CP'98 : 4th International Conference on " Principles and Practice of Constraint Programming, pp.147-162, 1998.
DOI : 10.1007/3-540-49481-2_12

H. Collavizza, F. Delobel, and M. Rueher, Comparing Partial Consistencies, Journal of Reliable Computing, vol.5, pp.213-228, 1999.
DOI : 10.1007/978-94-017-1247-7_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.8787

H. Collavizza, F. Delobel, and M. Rueher, Extending consistent domains of numeric csp, Proc of IJCAI'99 : 16th International joint conference on artificial intelligence, pp.406-411, 1999.

M. C. Cooper, An optimal k-consistency algorithm, Artificial Intelligence, vol.41, issue.1, pp.89-95, 1989.
DOI : 10.1016/0004-3702(89)90080-5

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 1991.

G. M. Crippen and T. , Distance geometry and molecular conformation, 1988.

R. Dechter, Learning while searching in constraint-satisfaction-problems, AAAI, pp.178-185, 1986.

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990.
DOI : 10.1016/0004-3702(90)90046-3

R. Dechter, From local to global consistency, Artificial Intelligence, vol.55, issue.1, pp.87-108, 1992.
DOI : 10.1016/0004-3702(92)90043-W

R. Dechter and I. Meiri, Experimental evaluation of preprocessing techniques in constraint satisfaction problems, IJCAI, pp.271-277, 1989.

A. K. Dhingra, A. N. Almadi, and D. Kohli, A Gro??bner-Sylvester Hybrid Method for Closed-Form Displacement Analysis of Mechanisms, Journal of Mechanical Design, vol.122, issue.4, pp.431-438, 2000.
DOI : 10.1115/1.1290395

P. Dietmaier, The Stewart-Gough Platform of General Geometry can have 40 Real Postures
DOI : 10.1007/978-94-015-9064-8_1

L. Doherty, K. S. Pister, and L. Ghaoui, Convex position estimation in wireless sensor networks, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.1655-1663, 2001.
DOI : 10.1109/INFCOM.2001.916662

I. Z. Emiris and B. Mourrain, Polynomial system solving : the case of a six-atom molecule, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073617

J. Faugère, A new efficient algorithm for computing Gr??bner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-88, 1999.
DOI : 10.1016/S0022-4049(99)00005-5

E. C. Freuder, Synthesizing constraint expressions, Communications of the ACM, vol.21, issue.11, pp.958-966, 1978.
DOI : 10.1145/359642.359654
URL : http://dspace.mit.edu/handle/1721.1/6247#files-area

E. C. Freuder, Backtrack-Free and Backtrack-Bounded Search, pp.343-369, 1988.
DOI : 10.1007/978-1-4613-8788-6_10

J. Gaschnig, A general backtrack algorithm that eliminates most redundant tests, IJCAI, p.457, 1977.

S. W. Golomb and L. D. Baumert, Backtrack Programming, Journal of the ACM, vol.12, issue.4, pp.516-524, 1965.
DOI : 10.1145/321296.321300

C. Gosselin, J. Sefrioui, and M. J. Richard, Polynomial solutions to the direct kinematic problem of planar three degree of freedom parallel manipulators. Mechanism and Machine Theory, pp.107-119, 1992.

]. L. Granvilliers, Realpaver : Solving non linear constraints by interval computations. User's manual, 2003.

D. U. Greemwald, Programmation linéaire et algorithme du simplexe. Dunod, 1960.

E. Hansen and R. Greenberg, An interval Newton method, Applied Mathematics and Computation, vol.12, issue.2-3, pp.89-98, 1983.
DOI : 10.1016/0096-3003(83)90001-2

E. R. Hansen, AN OVERVIEW OF GLOBAL OPTIMIZATION USING INTERVAL ANALYSIS, 1992.
DOI : 10.1016/B978-0-12-505630-4.50021-3

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

M. Heusch, distn: An Euclidean Distance Global Constraint, Proc. of CP'03 : 9th International Conference on " Principles and Practice of Constraint Programming " ), LNCS 2833, pp.975-975, 2003.
DOI : 10.1007/978-3-540-45193-8_99

M. L. Husty, An algorithm for solving the direct kinematic of stewart-gough-type platforms . Mechanism and Machine Theory, pp.365-380, 1996.

E. Hyvönen, Constraint reasoning based on interval arithmetic: the tolerance propagation approach, Artificial Intelligence, vol.58, issue.1-3, pp.71-112, 1992.
DOI : 10.1016/0004-3702(92)90005-I

C. Innocenti, Forward Kinematics in Polynomial Form of the General Stewart Platform, Journal of Mechanical Design, vol.123, issue.2, pp.254-260, 2001.
DOI : 10.1115/1.1348018

J. Faugère and D. Lazard, The combinatorial classes of parallel manipulators. Mechanism and Machine Theory, pp.765-776, 1995.

J. Merlet, Solving the Forward Kinematics of a Gough-Type Parallel Manipulator with Interval Analysis, The International Journal of Robotics Research, vol.23, issue.3, pp.221-236, 2004.
DOI : 10.1177/0278364904039806

L. Jaulin, M. Kieffer, O. Didrit, and E. Walter, Applied Interval Analysis, 2001.
DOI : 10.1007/978-1-4471-0249-6
URL : https://hal.archives-ouvertes.fr/hal-00845131

C. Jermann, Résolution de contraintes géométriques par rigidification récursive et propagation d'intervalles, 2002.

C. Jermann, B. Neveu, and G. Trombettoni, A New Structural Rigidity for Geometric Constraint Systems, Proc. of Fourth International Workshop on Automated Deduction in Geometry(ADG'02), 2002.
DOI : 10.1007/978-3-540-24616-9_6
URL : https://hal.archives-ouvertes.fr/hal-01408606

C. Jermann, B. Neveu, and G. Trombettoni, Inter-block backtracking : Exploiting the structure in continuous csps, 2nd International Workshop on Global Constrained Optimization and Constraint Satisfaction COCOS'03, 2003.

C. Jermann, G. Trombettoni, B. Neveu, and M. Rueher, A Constraint Programming Approach for Solving Rigid Geometric Systems, Proc. of CP'00 : Sixth International Conference on " Principles and Practice of Constraint Programming, pp.233-248, 2000.
DOI : 10.1007/3-540-45349-0_18
URL : https://hal.archives-ouvertes.fr/hal-01408615

P. Jégou, ContributionàContribution`Contributionà l'´ etude desprobì emes de satisfaction de contraintes : algorithmes de propagation et de résolution ; propagation de contraintes dans les réseaux dynamiques, 1991.

N. Jussien and O. Lhomme, Dynamic domain splitting for numeric CSPs, European Conference on Artificial Intelligence, pp.224-228, 1998.

W. M. Kahan, A more complete interval arithmetic, 1968.

R. B. Kearfott, A Review of Techniques in the Verified Solution of Constrained Global Optimization Problems, Applications of Interval Computations, pp.23-59, 1996.
DOI : 10.1007/978-1-4613-3440-8_2

R. B. Kearfott, Rigorous global search : continuous problems, 1996.
DOI : 10.1007/978-1-4757-2495-0

I. Kotsireas and I. Lazard, Central configurations of the 5-body problem with equal masses in three dimensional space, Proceedings of CASC, 1998.
URL : https://hal.archives-ouvertes.fr/hal-01148857

L. Krippahl and P. Barahona, Psico : Combining constraint programming and optimisation to solve macromolecular structures, Proc. of ERCIM/COMPULOG Workshop on Constraints, 2000.

L. Krippahl and P. Barahona, Propagating N-Ary Rigid-Body Constraints, Proc. of CP'03 : 9th International Conference on " Principles and Practice of Constraint Programming " ), LNCS 2833, pp.452-465, 2003.
DOI : 10.1007/978-3-540-45193-8_31

V. Kumar, Algorithms for constraint-satisfaction problems : A survey, AI Magazine, vol.13, issue.1, pp.32-44, 1992.

D. Lazard, Stewart platforms and gröbner basis, Proceedings of Advances in Robotics Kinematics, pp.136-142, 1992.

D. Lazard, Generalized stewart platform : How to compute with rigid motions ?, IMACS Symp. on Symbolic Computation, pp.85-88, 1993.

Y. Lebbah, ContributionàContribution`Contributionà la résolution de contraintes par consistance forte, Thès de doctorat, ´ Ecole des Mines de Nantes, 1999.

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, vol.42, issue.5
DOI : 10.1137/S0036142903436174
URL : https://hal.archives-ouvertes.fr/hal-00907765

Y. Lebbah, M. Rueher, and C. Michel, A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations, Proc of CP'02 : 8th International Conference on " Principles and Practice of Constraint Programming, 2002.
DOI : 10.1007/3-540-46135-3_8

T. Lee and J. Shim, Forward kinematics of the general 6-6 stewart platform using algebraic elimination. Mechanism and Machine Theory, pp.1073-1085, 2001.

O. Lhomme, A. Gotlieb, and M. Rueher, Dynamic optimization of interval narrowing algorithms, The Journal of Logic Programming, vol.37, issue.1-3, pp.165-183, 1998.
DOI : 10.1016/S0743-1066(98)10007-9
URL : https://hal.archives-ouvertes.fr/inria-00540302

O. Lhomme, Consistency techniques for numerical csps, IJCAI-93, pp.232-238, 1993.

O. Lhomme, ContributionàContribution`Contributionà la résolution de contraintes sur les réels par propagation d'intervalles, Thèse de doctorat, 1994.

A. Liu and T. Yang, Configuration analysis of a class of parallel structures using improved continuation, 9th World Congress on the Theory of Machines and Mechanisms, pp.155-158, 1995.

A. K. Mackworth, Constraint satisfaction, Encyclopedia of Artificial Intelligence, 1987.

A. Macworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

M. Cs and . Markót, An interval method to validate optimal solutions of the " packing circles in a unit square, Problems, Central European Journal of Operational Research, vol.8, pp.63-78, 2000.

M. Cs, T. Markót, and . Csendes, A new verified optimization technique for the " packing circles in a unit square " problems. SIAM, 2004.

J. Merlet, Solving the Forward Kinematics of a Gough-Type Parallel Manipulator with Interval Analysis, The International Journal of Robotics Research, vol.23, issue.3, p.4013, 2003.
DOI : 10.1177/0278364904039806

P. Meseguer, Constraint satisfaction problems : An overview, AI Commun, vol.2, issue.1, pp.3-17, 1989.

C. Michel, Y. Lebbah, and M. Rueher, Safe embedding of the simplex algorithm in a csp framework, 5th Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems CPAIOR 2003, pp.210-220, 2003.

R. Mohr and T. C. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4
URL : https://hal.archives-ouvertes.fr/inria-00548487

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

R. Moore, Interval analysis, 1966.

B. Mourrain, The 40¨generic¨positions40¨40¨generic¨40¨generic¨positions of a parallel robot, Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation(ISSAC), pp.173-182, 1993.

A. Neumaier, Interval Methods for Systems of Equations, Encyclopedia of Mathematics and its Applications, vol.37, 1990.
DOI : 10.1017/CBO9780511526473

W. Older and F. Benhamou, Programming in CLP(BNR) In Position Papers for the First Workshop on Principles and Practice of Constraint Programming, pp.239-249, 1993.

J. M. Porta, L. Ros, F. Thomas, and C. Torras, A branch-and-prune algorithm for solving systems of distance constraints, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), 2003.
DOI : 10.1109/ROBOT.2003.1241619

J. Puget, A fast algorithm for the bound consistency of alldiff constraints American Association for Artificial Intelligence, AAAI '98/IAAI '98 : Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, pp.359-366, 1998.

J. F. Puget and P. Van-hentenryck, A constraint satisfaction approach to a circuit design problem, 1996.

J. F. Puget and P. , Van Hentenryck. A constraint satisfaction approach to a circuit design problem, Journal of Global Optimization, vol.13, issue.1, pp.75-93, 1998.
DOI : 10.1023/A:1008236911603

P. W. Jr and . Purdom, Search rearrangement backtracking and polynomial average time, Artif. Intell, vol.21, issue.12, pp.117-133, 1983.

M. Raghavan, The Stewart Platform of General Geometry Has 40 Configurations, ASME Design and Automation Conf, pp.397-402, 1992.
DOI : 10.1115/1.2919188

D. Ratz, Box-Splitting-Strategien f??r den Intervall-Gauss-Seidel-Schritt in einem globalen Optimierungsverfahren, Computing, vol.1, issue.3-4, pp.337-354, 1994.
DOI : 10.1007/BF02307384

J. Régin, A filtering algorithm for constraints of difference in csps, AAAI '94 : Proceedings of the twelfth national conference on Artificial intelligence, pp.362-367, 1994.

J. Régin, Generalized arc consistency for global cardinality, AAAI-96, pp.209-215, 1996.

J. Régin, The symetric alldiff constraint, IJCAI-99, pp.420-425, 1999.

J. Régin, AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm, Proc. of CP'05 : 11th International Conference on " Principles and Practice of Constraint Programming " ), LNCS 3709, pp.505-519, 2005.
DOI : 10.1007/11564751_38

J. Régin and M. Rueher, A Global Constraint Combining a Sum Constraint and Difference Constraints, Proc. of CP'00 : Sixth International Conference on " Principles and Practice of Constraint Programming, pp.384-396, 2000.
DOI : 10.1007/3-540-45349-0_28

F. Ronga and T. Vust, Stewart platforms without computer?, Conf. Real Analytic and Algebraic Geometry, pp.197-212, 1992.
DOI : 10.1515/9783110881271.197
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5694

F. Rossi, C. J. Petrie, and V. Dhar, On the equivalence of constraint satisfaction problems, ECAI, pp.550-556, 1990.

F. Rouiller, Real Root Counting for Some Robotics Problems, Computational Kinematics, 1995.
DOI : 10.1007/978-94-011-0333-6_8

D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proc. of PPCP'94 : Second International Workshop on " Principles and Practice of Constraint Programming, pp.10-20, 1994.
DOI : 10.1007/3-540-58601-6_86

D. Sam-haroud, Constraint consistency techniques for continuous domains, 1995.

S. V. Sreenivasan and P. Nanua, Solution of the direct position kinematics problem of the general stewart platform using advanced polynomial continuation, 22nd Biennial Mechanisms Conf, pp.99-106, 1992.

P. G. Szabó, T. Csendes, L. G. Casado, and I. García, Equal circles packing in a square i. -problem setting and bounds for optimal solutions. Optimization Theory -Recent Developments from Matrahaza, pp.191-206, 2001.

M. R. Van-dongen, AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity, Proc of CP'02 : 8th International Conference on " Principles and Practice of Constraint Programming, 2002.
DOI : 10.1007/3-540-46135-3_58

P. Van-hentenryck and Y. Deville, The cardinality operator : A new logical connective for constraint logic programming, ICLP, pp.745-759, 1991.

P. Van-hentenryck, D. Mcallister, and D. Kapur, Solving Polynomial Systems Using a Branch and Prune Approach, SIAM Journal on Numerical Analysis, vol.34, issue.2, pp.797-827, 1997.
DOI : 10.1137/S0036142995281504

D. Waltz, Understanding line drawings of scenes with shadows The Psychology of Computer Vision, 1975.

Y. Zhang and R. H. Yap, Making ac-3 an optimal algorithm, IJCAI, pp.316-321, 2001.