. Bien-que-ce-graphe, il peut ne pas être maximal par rapport à ¡^ensemble G' (ou à i'ensemble_G) comme le montre ¡'exemple suivant : -hypothèses: seule la méthode rri| est requise, g,~((m¡j\ mi. m ¡® m 2),(m¡,\ m¡, eonsistante(m; . tn 4 ), consistante^;, m 4 ) et on veutjyouterja méthode m 4 aux gaep de g r

. Au, (f"i/A m^A m 4 ._m ¡® m 2 ® m 4 I, 0i) L, 'examen du deuxième couple au pas 7 résulte en G"=((m¡ au pas 9 : gaep'=(m¡^ m 4 . m ¡ © m 4 ). On voit bien que le couple calculé est recouvert par le couple dans G

. Et-donc, =Z c erp(zp) Inflm(c), n z (c)) + I ceI y Í2pV

. Card, < X c 6 rp't.zp') ¡ n ß m ( c )-n zp

. Par-transitivité-entre, et (6) on aboutit à : Card(z) ¿ \l(T pKJp -(z}) Ceci pour tout z c V " u V ?

. Exemple-d-'ajout-d-'une-contrainte, L'exemple de la figure 72 montre le déroulement de la procédure d'ajout d'une contrainte. Initialement , on suppose l'existence d'un graphe solution montré par la figure 72.a. Lorsque la contrainte Cg est ajoutée à la hiérarchie, la procédure d'ajout décrite avant procède comme suit, La cellule pj est créée contenant la contrainte c 8 (figure 72.b) et l'étiquette de la contrainte victime est déterminée

A. Borning, R. Duiberg, B. Freeman-benson, A. Kramer, and M. Woolf, Constraint hierarchies, ACM, editor, proc. of the 1987 ACM Conference on Object-Oriented Programming Systems Languages, and Applications, pp.48-60, 1987.
DOI : 10.1007/3-540-61479-6_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9249

A. Borning, M. Bjom-freeman-benson, and . Wilson, Constraint Programming, computer and systems Constraint Hierarchies Number 131 in F, pp.75-115, 1994.

J. Bowen, R. Lai, and D. Bahier, Fuzzy semantics and fuzzy constraint networks, [1992 Proceedings] IEEE International Conference on Fuzzy Systems, pp.1009-1016, 1992.
DOI : 10.1109/FUZZY.1992.258793

A. Borning, M. Maher, A. Martindale, and M. Wilson, Constraint hierarchies and logic programming, proc. of the Sixth International Conference on Logic Programming, pp.149-164, 1989.

M. Bouzoubaa and B. Neveu, Résolveurs de hiérarchies de contraintes, les actes de la Deuxième Conférence Internationale en Recherche Opérationnelle : Théorie et Applications (CIRO'96), 1996.

M. B. Bouzoubaa, G. Neveu, and . Hasle, Houria II : A solver for hierarchical systems , planning of lexicographic satisfied count best case better graph for equational constraints, Constrain! for Graphics and Visualization International Workshop in conjunction with CP-95, 1995.

M. Bouzoubaa, B. Neveu, and G. Hasle, A solver for equational constraints in a hierarchical system, proc . of the Over Constrained Systems (OCS) International Workshop in conjunction with CP-95, 1995.

M. Bouzoubaa, B. Neveu, and G. Hasle, Computer Science and Operations Research : Recent Advences in The Interface, chapter Houria III : Planning of Lexicographic Weight Sum Better Graph for Equational Constraints, 1996.

K. Bohringer, Using constraints to achieve stability in automatic graph layout algorithms, Proceedings of the SIGCHI conference on Human factors in computing systems Empowering people, CHI '90, pp.43-52, 1990.
DOI : 10.1145/97243.97250

A. H. Boming, The programming language aspects of Thinglab, a constraint-oriented simulation laboratory, ACM Transactions on Programming Languages and Systems, vol.3, issue.4, pp.353-387, 1981.

M. Bouzoubaa, Un résolveur de système de contraintes fonctionnelles hiérarchique, 1994.

M. Bouzoubaa, The Houria constraint solver, IOS press Proc. of Fifth Scandinavian Conference On Artificial Intelligence (SCAl'95), 1995.

M. Bouzoubaa, The Houria constraint solver, proc. of the International Conference on Applications of Artificial intelligence in Engineering X (AlEng'95), pp.239-226, 1995.

M. Bouzoubaa, An incremental constraint solver. Inproc. ofConstraint'95, pages 104? 111, FLAlRS-95. International Workshop on Constraint-Based Reso- ning, 1995.

M. Bouzoubaa and . Latif, Solver for multi-output constraints in hierarchical system, Draft paper , presented on the SINTEF International Symposium on Constraint Reasoning and Related Topics, 1995.

M. Bouzoubaa, Functional constraint hierarchies in constraint logic programming, of the International Conference on the Principies and Practice of Constraint Programing (CP-96), 1996.

]. J. Bre89 and . Brewka, Preferred subtheories: an extended logical framework for default reasoning, proc. of the 11th. Joint Conference on Artificial Intelligence (IJCAI 89), pp.1043-1048, 1989.

J. Cohen, Constraint logic programming languages, Communications of the ACM, vol.33, issue.7, pp.52-68, 1990.
DOI : 10.1145/79204.79209

A. Colmerauer, An Introduction to ProloglH. Groupe Intelligence Artificielle, 1987.

J. [. Descottes and . Latombe, Making compromises among antagonist constraints in a planner, Artificial Intelligence, vol.27, issue.2, pp.149-164, 1985.
DOI : 10.1016/0004-3702(85)90053-0

[. Dincbas, P. Van-hentenryck, H. Simonis, A. Aggoum, T. Graf et al., The constraint logic programming language Chip. Inproc. of FGCS-88, 1988.

H. Fargier, Problème de satisfaction de contraintes flexibles application à l'ordonnancement de production, thèse de doctorat, 1994.

]. B. Fre88 and . Freeman-benson, Multiple solutions from constraint hierarchies, 1988.

N. Bjom and . Freeman-benson, Constraint Imperative Programming, 1991.

B. Freeman-benson and A. Boming, The design and implementation of Kaleidoscope'90, a constraint imperative programming language, In proc, of the IEEE Computer Society International Conference on Computer Languages, pp.174-180, 1992.

B. Freeman-benson and J. Masoney, The DeltaBlue algorithm: an incremental constraint hierarchy solver, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings, 1989.
DOI : 10.1109/PCCC.1989.37442

B. Freeman-benson, J. Maloney, and A. Boming, The DeltaBlue algorithm: an incremental constraint hierarchy solver, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings, 1989.
DOI : 10.1109/PCCC.1989.37442

B. Freeman-benson, J. Maloney, and A. Borning, An incremental constraint solver, Communications of the ACM, vol.33, issue.1, pp.54-63, 1990.
DOI : 10.1145/76372.77531

B. Freeman-benson and M. Wilson, Deltastar, how i wonder what you are : A general algorithm for incremental satisfaction of constraint hierarchies, 1990.

B. Freeman-benson, M. Wilson, A. B. Fallings, D. Haroud, and I. Smith, Deltastar: A general algorithm for incremental satisfaction of constraint hierarchies Dynamic constraint propagation with continuous variables, IEEE proc. of the ECAI'92, pp.754-758, 1992.

. [. Freuder and . Snow, Improved relaxation and search methods for approximate constraint satisfaction with a maximum criterion, proc. of the 8.th Conference of the Canadian Society for Computational Studies of Intelligence, pp.227-230, 1989.

G. [. Guan and . Friedrich, Extending constraint satisfaction problem solving in structural design, proc. of the 5th International Conference IEA/AIE, pp.341-350, 1992.
DOI : 10.1007/BFb0024986

J. A. Gosling, Algebraic Constraints, 1983.

M. Gangnet and B. Rosenberg, Constraint programming and graph algorithms, proc. of the Second International Symposium on Artificial Intelligence and Mathematics, 1992.
DOI : 10.1007/BF01530793

H. D. Hill, T. Brinck, S. L. Rohall, J. F. Patterson, and W. Wilner, The Rendezvous architecture and language for constructing multiuser applications, ACM Transactions on Computer-Human Interaction, vol.1, issue.2, pp.81-125, 1994.
DOI : 10.1145/180171.180172

R. D. Hill, constraint maintenance system, Proceedings of the 6th annual ACM symposium on User interface software and technology , UIST '93, 1993.
DOI : 10.1145/168642.168665

J. [. Heintze, S. Jaffar, P. Michaylov, R. Stuckey, and . Yap, The clp(r) programmer's manual, 1987.

H. Hiroshi, M. Ken, M. Takahashi-shin, A. Satoshi, and . Yonezawa, Locally simultaneous constraint satisfaction, proc. of the Principles and Practice of Constraint Programming, 1994.

S. [. Hummel and . Zucker, On the foundations of relaxation labeling processes, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.5, issue.3, pp.267-287, 1983.

J. P. Ignizio, Generalized goal programming An overview, Computers & Operations Research, vol.10, issue.4, pp.277-290, 1983.
DOI : 10.1016/0305-0548(83)90003-5

J. P. Ignizio, Introduction to linear goal programming, Sage University Paper Series on Qualitative Application in theorical Sciences, pp.7-560, 1985.
DOI : 10.4135/9781412984669

J. Jaffar and J. Lassez, Constraint logic programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, 1987.
DOI : 10.1145/41625.41635

J. Jaffar and S. Michaylov, Methodology and implementation of a CLP system, proc. of the Fourth International Conference on Logic Programming, pp.196-218, 1987.

M. Konopasek and S. Jayaraman, The TK, 1984.

T. Kamada and S. Kawai, A general framework for visualizing abstract objects and relations, ACM Transactions on Graphics, vol.10, issue.1, p.39, 1991.
DOI : 10.1145/99902.99903

]. W. Lel86 and . Leler, Specification and Generation of Constraint Satisfaction Systems Using Augmented Term Rewriting, 1986.

W. Leler, Constraint Programming Languages, 1987.

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

J. Michael and . Maher, Logic semantics for a class of committed-choice programs, proc. of the Fourth Internationational Conference on Logic Programming, pp.858-876, 1987.

. John and . Maloney, Using Constraints for User Interface Construction, 1991.

]. R. Clo92 and . Martin-clouaire, Dealing with soft constraints in a constraint satisfaction problem, proc. of the International Conference on Information Procesing of Uncertaintly in Knowledge-based Systems IPMU'92, pp.37-40, 1992.

B. A. Myers, D. Guise, R. B. Dannenberg, B. Vander-zanden, and D. Kosbie, PJippe Mar, and Ed. Pervin. The Garnet toolkit reference manuals: Support for highly-interactive graphical user interfaces in lisp, 1990.

B. A. Myers, D. Guise, R. B. Dannenberg, B. Vander-zanden, and D. Kosbie, Plippe Mar, and Ed. Pervin. Comprehensive support for graphical, highly-interactive user interfaces : The garnet user interface development environment, IEEE Computer, issue.23, pp.71-85, 1991.

G. [. Mohr and . Masini, Good old discrete relaxation, proc. of the ECAI'88, pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

J. Michael, P. J. Maher, and . Stuckey, Expanding query power in constraint logic programming, 1991.

. Greg and . Nelson, Juno : A constraint-based graphics system, ACM, editor, proc, of the SIGGRAPH, pp.235-243, 1985.

]. A. Rob66 and . Robinson, Non-Standard Analysis, 1966.

M. Sannella, The Skyblue constraint solver, 1993.

M. Sannella, Constraint Satisfaction and Debugging for Interactive User Interfaces, 1994.

A. Vijay and . Saraswat, Problems with concurrent prolog, 1985.

V. Saraswat, Programming in Timed Concurrent Constraint Languages, 1989.
DOI : 10.1007/978-3-642-85983-0_15

T. Schiex, Possibilistic Constraint Satisfaction Problems or ???How to handle soft constraints????, In proc. of the Eighth Conference on Uncertain! in Artificial Intelligence, pp.268-275, 1992.
DOI : 10.1016/B978-1-4832-8287-9.50041-4

. Ehud and . Shapiro, Concurrent prolog : A progress report, IEEE Computer, vol.19, issue.8, pp.44-58, 1986.

S. Sistare, A Graphical Editor for Constraint-Based Geometric Modeling, 1990.

T. Schiex and P. Janssen, Représentation et traitement pratique de la flexibilité dans les problèmes sous contraintes, pp.369-426, 1992.

V. A. Saraswat, M. Rinard, and P. Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, 1991.
DOI : 10.1145/99583.99627

T. Shim, M. Satoshi, and Y. Akinori, A general framework for bi-directional translation between abstract and pictorial data, ACM, editor, proc. of the ACM SiGGRAPH Symposium on User Interface Software and Technyolog, pp.65-174, 1991.

I. Sutherland, Sketchpad, Proceedings of the May 21-23, 1963, spring joint computer conference on, AFIPS '63 (Spring), 1963.
DOI : 10.1145/1461551.1461591

I. Sutherland, Sketchpad, Proceedings of the May 21-23, 1963, spring joint computer conference on, AFIPS '63 (Spring), 1963.
DOI : 10.1145/1461551.1461591

T. H. Schiex, G. Fargier, and . Verfaillie, Valued constraint satisfaction problems : hard and easy problems, proc. of the IJCAI, pp.631-637, 1995.

T. Schiex and G. Verfaillie, NOGOOD RECORDING FOR STATIC AND DYNAMIC CONSTRAINT SATISFACTION PROBLEMS, International Journal on Artificial Intelligence Tools, vol.03, issue.02, pp.187-207, 1994.
DOI : 10.1142/S0218213094000108

G. Trombettoni, Formalizing local propagation in constraint maintenance systems In Springer, editor, proc. of EPIA '95, number 990 in LNAI, 1995.

P. Van and H. , Constraint satisfaction in logic programming, 1989.

G. Verfaillie and T. Schiex, Maintien de solution dans les problèmes dynamiques de satisfaction de contraintes : bilan de quelques approches, 1995.

B. Vander-zanden, Incremental Constraint Satisfaction and Its Application to Graphical Interfaces, 1988.

B. Vander-zanden, A domain-independent algorithm for incrementally satisfying multi-way constraints, 1992.

B. Vander-zanden, An incremental algorithm for satisfying hierarchies of multi-way, dataflow constraints, 1995.

B. Vander-zanden, A. B. Myers, D. Giuse, and P. Szekely, Integrating pointer variables into one-way constraint models, ACM Transactions on Computer-Human Interaction, vol.1, issue.2, pp.161-213, 1994.
DOI : 10.1145/180171.180174

]. D. Wal75 and . Waltz, The psychology of computer vision, 1975.

M. Wilson and A. Boming, Extending hierarchical constraint logic programming: Nonmonotonicity and inter-hierarchy comparaison, proc of the North American Conference on Logic Programming, 1989.
DOI : 10.1016/0743-1066(93)90046-j
URL : http://doi.org/10.1016/0743-1066(93)90046-j

M. Wilson, Hierarchical constraint logic programming, The Journal of Logic Programming, vol.16, issue.3-4, 1992.
DOI : 10.1016/0743-1066(93)90046-J

. J. Wí194-]-rosener and . William, Integrating Multi-way and Structural Constraints into Spreadsheet Programming, 1994.

J. Christopher and . Van-wyk, A Language for Typesetting Graphics, 1980.

J. Christopher and . Van-wyk, A high-level language for specifying pictures, ACM Transactions on Graphics, vol.1, issue.2, 1982.

. Dans-un-troisième-temps, nous proposons une procédure utilisant le résolveur précédent Cette dernière est plus prometteuse qu'un algorithme du type séparation et évaluation, Elle peut être incorporée dans les langages de Programmation Logique par Hiérarchie de Contraintes afin de réaliser la comparaison inter-hiérarchies et donc de pouvoir éliminer les hiérarchies telles que leurs résolutions produiraient des solutions non désirables

. Enfin, nous avons modélisé un résolveur pour la résolution de hiérarchies de contraintes où Ses modes de combinaison peuvent varier selon les niveaux. Ce dernier prend en compte des contraintes possédant des méthodes recalculant plusieurs variables à la fois et établit un plan de coopération entre des résolveurs spécifiques