]. A. Aik94 and . Aiken, Set Constraints: Results, Applications and Future Directions, PPCP'94. Principle and Practice of Constraint Programming, 1994.

A. Aiken and E. L. Wimmers, Solving systems of set constraints, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, 1992.
DOI : 10.1109/LICS.1992.185545

B. , N. Beldiceanu, and E. Contejean, Introducing Global Constraints in CHIP, Mathematical Computation Modelling, pp.97-123, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00442810

P. Bruscoli, A. Dovier, E. Pontelli, and G. Rossi, Compiling Intensional Sets in CLP, pp.94-647, 1994.

]. N. Bel90a and . Beldiceanu, Deenition of Global Constraints, 1990.

]. N. Bel90b and . Beldiceanu, An example of introduction of global constraints in CHIP: Application to block theory problems

]. F. Ben95 and . Benhamou, Interval Constraint Logic Programming, Constraint Programming: Basics and Trends, 1995.

B. L. Bachmair, H. Ganzinger, and U. Waldmann, Set constraints are the monadic class, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, 1967.
DOI : 10.1109/LICS.1993.287598

M. Barbut and B. Montjardet, Ordre et Classiication: alg ebre e t combinatoire 1 , v olume 1. Hachette, 1970.

F. Benhamou, D. Macallester, P. , H. Bibliography, B. C. Beeri et al., CLP (Intervals ) revisited Set constructors in a logic database language, ILPS'94 Journal of Logic Programming, pp.124-138, 1991.

F. Benhamou and T. , Prolog IV: langage et algorithmes, Journ ees francophones de la programmation logique, pages 50{64. JFPL'95, 1995.

]. A. Bun84 and . Bundy, A generalized Interval Package and its use for Semantical Checking, In ACM Transaction on Mathematical Systems, vol.10, issue.4, pp.397-409, 1984.

C. A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel, Un syst eme de communication homme-machine en Frann cais. tech. rep., AI Group, 1973.

]. J. Cle87 and . Cleary, Logical arithmetic, Future Generation Computing Systems, pp.125-149, 1987.

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

]. A. Col87 and . Colmerauer, Opening the prolog III Universe, BYTE magazine, 1987.

]. A. Col90 and . Colmerauer, An introduction to Prolog III, Communications of ACM, vol.33, issue.7, pp.70-90, 1990.

Y. Caseau and J. Puget, Constraints on Order-Sorted Domains, ECAI'94, 1994.

D. Dincbas, P. Hentenryck, H. Simonis, A. Aggoun, and F. Graf, Applications of CHIP to industrial and engineering problems, Proceedings of the first international conference on Industrial and engineering applications of artificial intelligence and expert systems , IEA/AIE '88, 1988.
DOI : 10.1145/55674.55703

D. A. Dovier, E. G. Omodeo, E. Pontelli, and G. Rossi, flogg: A Logic Programming Language with Finite Sets, ICLP'91, pp.111-124, 1991.

A. Dovier and G. Rossi, Embedding Extensional Finite Sets in CLP, ILPS'93, 1993.

]. M. Dsea88, H. Dincbas, and P. Simonis, The Constraint Logic Programming Language CHIP, FGCS, Japan, 1988.

]. M. Dsh88a, H. Dincbas, and P. Simonis, Solving Large Combinatorial Problems in Logic Programming, Journal of Logic Programming, 1988.

M. Dincbas, H. Simonis, and P. , Solving the Car- Sequencing Problem in Constraint Logic Programming, ECAI, 1988.

]. R. Fik70 and . Fikes, Ref-arf: A system for solving problems stated as procedures, Artiicial Intelligence, vol.1, pp.27-120, 1970.

]. R. Flo67 and . Floyd, Nondeterministic algorithms, Journal of the Association for Computing Machinery, vol.14, issue.4, pp.636-644, 1967.

]. R. Fra86 and . Fraiss-e, Theory of Relations, v olume 118 of Studies in logic and the foundations of mathematics, 1986.

]. E. Fre78 and . Freuder, Synthesizing Constraint Expressions, CACM, c hapter 21, pp.958-966, 1978.

]. E. Fre82 and . Freuder, A Suucient Condition for Backtrack-Free Search, CACM, c hapter 19, pp.24-32, 1982.

G. , 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

]. G. Gea80, K. H. Gierz, and . Hofman, A Compendium of Continuous Lattices, 1980.

]. C. Ger93a and . Gervet, New structures of symbolic constraint objects: sets and graphs, WCLP'93, 1993.

]. C. Ger93b and . Gervet, Sets and binary relation variables viewed as constrained objects, Workshop on Logic Programming with Sets conjunction with ICLP'93, pp.5-8, 1993.

]. C. Ger94 and . Gervet, Conjunto : Constraint Logic Programming with Finite Set Domains, ILPS'94, pp.339-358, 1994.

G. , M. R. Garey, and D. S. Johnson, Computers and intractability, A guide to the theory of NP-completeness, pp.124-130, 1979.

M. Gondran and M. Minoux, Graphs and algorithms, Series in Discrete Mathematics. Wiley-interscience, Great Britain, 1984.
URL : https://hal.archives-ouvertes.fr/hal-01304880

P. Hentenryck and M. Dincbas, Domains in Logic Programming, AAAI-86, 1986.

H. , P. Hentenryck, and M. Dincbas, Forward checking in Logic Programming, Proc. of the Fourth International Conference o n L P , M a y 1 9 8 7

H. , P. Hentenryck, and Y. Deville, Operational Semantics of Constraint Logic Programming over Finite Domains, Proceedings of PLILP'91, pp.396-406

H. , P. Hentenryck, Y. Deville, and C. Teng, A generic arcconsistency algorithm and its specializations, Artiicial Intelligence, vol.57, pp.291-321, 1992.

H. , R. M. Haralick, and L. G. Elliot, Increasing tree search eeciency for constraint satisfaction problems, In Artiicial Intelligence, issue.14, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-x

]. P. Hen91, Constraint logic programming, The Knowledge Engineering Review, vol.6, issue.3, pp.151-194, 1991.

]. M. Hib95 and . Hibti, D ecidabilit e e t c omplexit e d e s y s t emes de constraintes ensemblistes A Decision Procedure for a Class of Set Constraints, Proceedings of the Sixth Annual IEEE Symposium on Logic in CS, pp.300-309, 1991.

M. Hibti, H. Lombardi, and B. Legeard, Deciding in HFS-Theory via Linear Integer Programming with Application to Set Uniication, LPAR'93, pp.170-181, 1993.

M. Hibti, B. Legeard, and H. Lombardi, Decision Procedure for Constraints over Sets, Multi-sets and Sequences, Rapport de recherche LAB-TRIAP9409, L.I.B., Besann con, 1994.

]. C. Hol92 and . Holzbaur, Metastructures vs Attributed Variables in the Context of Extensible Uniication, PLILP'92, pp.260-268, 1992.

K. L. Hooman and M. Padberg, Solving Airline Crew-Scheduling Problems by Branch-and-Cut, 1992.

H. , P. Hentenryck, V. Saraswat, and Y. Deville, Design, Implementation , and Evaluation of the Constraint Language cc(fd)

]. S. Hui90 and . Huitouze, A New Datastructure for Implementing Extensions to Prolog, 2nd Int. Work. Programming Languages Implementation and Logic Programming JL87] J. Jaaar and J.-L. Lassez. Constraint Logic Programming Proceedings of the 14th ACM Symposium on Principles of Programming Languages, pp.136-150, 1987.

J. Jaaar and S. Michaylov, Methodology and Implementation of a CLP system, Fourth ICLP conference, 1987.

J. Jaaar and M. J. Maher, Constraint Logic Programming: a Survey . I n Journal of Logic Programming, c hapter 19(20), pages 503{581, JP89] B. Jayaraman and D.A. Plaisted. Programming with Equations, Subsets , and Relations Proceedings of the North American Conference, pages 1051{1068. Logic Programming, 1989.

P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz, Constraint Query Languages, Proc. 9th ACM PODS, pp.299-313, 1990.
DOI : 10.1006/jcss.1995.1051
URL : https://doi.org/10.1006/jcss.1995.1051

D. Kapur and P. Narendran, Np-completeness of the set uniication and matching problems, CADE, pp.489-495, 1986.

]. R. Kow74 and . Kowalski, Predicate Logic as a Programming Language, IFIP, pp.569-574, 1974.

]. G. Kup90 and . Kuper, Logic Programming with Sets, v olume 41 of 1, pages 44{64, 1990.

J. L. Lauri-ere, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.
DOI : 10.1016/0004-3702(78)90029-2

]. O. Lho93 and . Lhomme, Consistency Techniques for Numeric CSPs, Proceedings of the 13th IJCAI conference. IJCAI, 1993.

L. Legeard and E. Legros, Short overview of the CLPS system, Proceedings of PLILP'91, P assau 3rd International Symposium on Programming Language Implementation and Logic Programming. LL92] B. Legeard and E. Legros. Test de satisfaisabilit e dans le langage de programmation en logique avec contraintes ensemblistes: CLPS. In Actes des JFPL, pp.18-34, 1991.
DOI : 10.1007/3-540-54444-5_123

L. B. Legeard, H. Lombardi, E. Legros, and M. Hibti, A Constraint S a t isfaction Approach to Set Uniication, 13th International Conference o n A rtiicial Intelligence, Expert Systems and Natural Language, EC2, 1993.

]. J. Llo87, M. Lloyd, J. Livesey, and . Siekmann, Foundations of logic programming Topics on Steiner Systems, v olume 7 of Annals of Discrete Mathematics Uniication of Sets and Multisets. Memo seki-76-ii, Livesey and J. Siekmann. Uniication of Sets and Multisets. Internal report, 1976.

]. H. Lue89 and . Lueneburg, Tools and fundamental Constructions of Combinatorial Mathematics, c hapter II VIII X, 1989.

J. H. Lee and H. Van-emden, Interval computation as deduction in chip, Journal of Logic Programming, pp.255-276, 1993.
DOI : 10.1016/0743-1066(93)90045-I

]. J. Mcg79 and . Mcgregor, Relational consistency algorithms and their application in nding subgraph and graph isomorphisms, Information Sciences, pp.229-250, 1979.

M. , A. K. Mackworth, and E. C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artiicial Intelligence, vol.25, 1985.

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

]. U. Mon74 and . Montanari, Networks of Constraints: Fundamental Properties and Applications to Picture Processing, In Information Science, vol.7, issue.2, pp.95-132, 1974.

U. Montanari and F. Rossi, Constraint relaxation may be perfect, Artificial Intelligence, vol.48, issue.2, pp.143-170, 1991.
DOI : 10.1016/0004-3702(91)90059-S

U. Montanari and F. Rossi, Constraint Logic Programming Selected Research, c hapter Finite Domain Constraint Solving and Constraint Logic Programming, pp.201-221, 1993.

]. B. Nad88 and . Nadel, Tree search and arc consistency in constraint satisfaction algorithms, Search in Artiicial Intelligence, pp.287-342, 1988.

O. Oplobedu, Charme: Un Langage Industriel de Programmation par Contraintes, Avignon, vol.89

W. Older and A. Vellino, Extending Prolog with Constraint Arithmetic on Real Intervals, IEEE Canadian Conference o n E l e ctrical and Computer Engineering

]. M. Pad79 and . Padberg, Covering, Packing and Knapsack Problems, Annals of Discrete Mathematics, 1979.

]. Z. Paw84 and . Pawlak, Rough Classiication, In International Journal of Man- Machine Studies, pp.469-483, 1984.

]. Z. Paw91 and . Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data. D: System theory, Knowledge engineering and Problem solving, 1991.

P. , K. J. Perry, K. V. , K. Macaloon, and G. M. Kuper, The Complexity of Logic Programming with Sets, PS82] C. H. Papadimitriou and K. Steiglitz. COMBINATORIAL OPTI- MIZATION: Algorithms and Complexity, 1982.

P. Puget, Programmation par contraintes orient ee objet, Proceedings of Avignon, pages 129{138, p.92, 1992.

F. Rossi and U. Montanari, Exact Solution in Linear Time of Networks of Constraints Using Perfect Relaxation, International Conf. on Principles of Knowledge Representation, pp.394-399, 1989.

F. Rossi and U. Montanari, Constraint Relaxation as Higher Order Logic Programming, META'90 Proceedings of the 2nd workshop on metaprogramming in logic, 1990.

]. A. Sch86 and . Schrijver, Theory of Linear and Integer Programming, 1986.

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

O. Shmueli, S. Tsur, and C. Zaniolo, Compilation of set terms in the logic data language (LDL), The Journal of Logic Programming, vol.12, issue.1-2, pp.89-119, 1992.
DOI : 10.1016/0743-1066(92)90040-A

]. R. Ull66 and . Ullman, Associating Parts of Patterns, In Information Control, issue.96, pp.583-601, 1966.

]. R. Wal60 and . Walker, An Enumerative T echnique for a Class of Combinatorial Problems, Amer. Math. Soc. Proc. Symp. Appl. Math, vol.10, pp.91-94, 1960.

]. D. Wal75 and . Waltz, The Psychology of Computer Vision, c hapter Understanding line drawings of scenes of shadows, 1975.

]. C. Wal89 and . Walinsky, CLP(( ): Constraint Logic Programming with Regular Sets, ICLP'89, pp.181-190, 1989.

M. Wallace, S. Bressan, and T. L. Provost, Magic Checking: Constraint C h e c king for Database Query Optimisation, Proceedings of the rst workshop on Constraints and Databases and their applications, CDB'95, 1995.
DOI : 10.1007/3-540-60794-3_19
URL : http://www.icparc.ic.ac.uk/papers/magic_checking:_constraint_checking_for_.ps