{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:47:09Z","timestamp":1762458429224},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf00137870","type":"journal-article","created":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T01:33:54Z","timestamp":1099272834000},"page":"191-244","source":"Crossref","is-referenced-by-count":94,"title":["Interval propagation to reason about sets: Definition and implementation of a practical language"],"prefix":"10.1007","volume":"1","author":[{"given":"Carmen","family":"Gervet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Baptiste, P., Legeard, B., & Lombardi, H. (1994). Sequence constraints for solving scheduling problems. In 3rd IFIP Working Conference."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Beeri, C., Naqvi, S., Shmueli, O., & Tsur, S. (1991). Set constructors in a logic database language. In Journal of Logic Programming. Elsevier.","DOI":"10.1016\/0743-1066(91)90036-O"},{"key":"CR3","series-title":"Internal Report IR-LP-22-30","volume-title":"Definition of global constraints","author":"N. Beldiceanu","year":"1990","unstructured":"Beldiceanu, N. (1990). Definition of global constraints. Internal Report IR-LP-22?30, ECRC, Munich Germany."},{"key":"CR4","series-title":"Technical Report TR-LP-49","volume-title":"An example of introduction of global constraints in CHIP: Application to block theory problems","author":"N. Beldiceanu","year":"1990","unstructured":"Beldiceanu, N. (1990). An example of introduction of global constraints in CHIP: Application to block theory problems. Technical Report TR-LP-49, ECRC, Munich Germany."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. In Elsevier Science, editor, Mathematical Computation Modelling 20(12): 97?123.","DOI":"10.1016\/0895-7177(94)90127-9"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Benhamou, F. (1995). Interval constraint logic programming. In A. Podelski, editor, Constraint Programming: Basics and Trends. LNCS 910, Springer Verlag.","DOI":"10.1007\/3-540-59155-9_1"},{"key":"CR7","unstructured":"Benhamou, F., MacAllester, D., & Van Hentenryck, P. (1994). CLP (intervals) revisited. In ILPS'94, pages 124?138."},{"key":"CR8","unstructured":"Birkhoff, G. (1967). Lattice Theory, volume 25 of Colloquium Publications. American Mathematical Society."},{"key":"CR9","unstructured":"Boucher, E. & Legeard, B. (1996). Fonctions de voisinage progressives et admissibles pour des m\u00e9thodes d'optimisation en PLC sur s\u00e9quences. In Actes du Congr\u00e8s JFPLC'96, pages 255?270."},{"key":"CR10","unstructured":"Bruscoli, P., Dovier, A., Pontelli, E., & Rossi, G. (1994). Compiling intensional sets in CLP. In P. Van Hentenryck, editor, ICLP'94, pages 647?664."},{"key":"CR11","unstructured":"Carlson, B., Haridi, S., & Janson, S. (1994). AKL(FD) a concurrent language for FD programming. In M. Bruynooghe, editor, ILPS'94, pages 521?538."},{"key":"CR12","unstructured":"Caseau, Y., & Puget, J-F. (1994). Constraints on order-sorted domains. In Workshop on Constraint Processing, in Conjunction with ECAI'94."},{"issue":"2","key":"CR13","first-page":"125","volume":"2","author":"J. G. Cleary","year":"1987","unstructured":"Cleary, J. G. (1987) Logical arithmetic. In Future Generation Computing Systems 2(2):125?149.","journal-title":"Future Generation Computing Systems"},{"key":"CR14","unstructured":"Colmerauer, A. (1987). Opening the prolog III universe. In BYTE Magazine."},{"issue":"4","key":"CR15","first-page":"271","volume":"2","author":"A. Colmerauer","year":"1983","unstructured":"Colmerauer, A., & Kanoui, H., & Van Caneghem, M. (1983). Prolog, bases th\u00e9oriques et d\u00e9veloppements actuels. In T.S.I. (Techniques et Sciences Informatiques) 2(4):271?311.","journal-title":"T.S.I. (Techniques et Sciences Informatiques)"},{"key":"CR16","unstructured":"Dincbas, M., Simonis, H., & Van Hentenryck P., et al. (1988). The constraint logic programming language CHIP. In FGCS."},{"key":"CR17","unstructured":"Dincbas, M., Simonis, H., & Van Hentenryck, P. (1988). Solving large combinatorial problems in logic programming. In Journal of Logic Programming."},{"key":"CR18","unstructured":"Dovier, A., Omodeo, E. G., Pontelli, E., & Rossi, G. (1991). {log}: A logic programming language with finite sets. In ICLP'91, pages 111?124."},{"key":"CR19","unstructured":"Dovier, A., & Rossi, G. (1993). Embedding extensional finite sets in CLP. In ILPS'93."},{"key":"CR20","unstructured":"ECRC. (1994). ECLiPSe (a) user manual, (b) extensions of the user manual. Technical Report, ECRC."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","volume":"1","author":"R. E. Fikes","year":"1970","unstructured":"Fikes, R. E. (1970). Ref-arf: A system for solving problems stated as procedures. In Artificial Intelligence 1:27?120.","journal-title":"Artificial Intelligence"},{"key":"CR22","unstructured":"Fraiss\u00e9, R. (1986). Theory of relations. In Studies in Logic and the Foundations of Mathematics 118. Elsevier Science."},{"key":"CR23","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability, A Guide to the Theory of NP-Completeness. Victor Klee."},{"key":"CR24","unstructured":"Gervet, C. (1993). New structures of symbolic constraint objects: Sets and graphs. In WCLP'93."},{"key":"CR25","unstructured":"Gervet, C. (1993). Sets and binary relation variables viewed as constrained objects. In Workshop on Logic Programming with Sets. In conjunction with ICLP'93."},{"key":"CR26","unstructured":"Gervet, C. (1994). Conjunto: Constraint logic programming with finite set domains. In M. Bruynooghe, editor, ILPS'94, pages 339?358."},{"key":"CR27","series-title":"Ph.D. thesis","volume-title":"Set intervals in constraint logic programming: Definition and implementation of a language","author":"C. Gervet","year":"1995","unstructured":"Gervet, C. (1995). Set intervals in constraint logic programming: Definition and implementation of a language. Ph.D. thesis, Universit\u00e9 de Franche-Comt\u00e9, France. European thesis, in English."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Gierz, G., & Hoffman, K. H., et al. (1980). A Compendium of Continuous Lattices. Springer Verlag.","DOI":"10.1007\/978-3-642-67678-9"},{"key":"CR29","unstructured":"Gondran, M., & Minoux, M. (1984). Graphs and Algorithms. Wiley-Interscience."},{"key":"CR30","unstructured":"Graetzer, G. (1971). LATTICE THEORY: First Concepts and Distributive Lattices. W.H. Freeman and Company."},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"Guerinik, N. & Van Caneghem, M. (1995). Solving crew scheduling problems by constraint programming. In CP'95, pages 481?498, Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-60299-2_29"},{"key":"CR32","unstructured":"Van Hentenryck, P. (1989). Constraint Satisfaction in Logic Programming. The MIT Press."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P. Hentenryck Van","year":"1992","unstructured":"Van Hentenryck, P., Deville, Y., and Teng, C.-M. (1992). A generic arc-consistency algorithm and its specializations. In Artificial Intelligence 57:291?321.","journal-title":"Artificial Intelligence"},{"key":"CR34","unstructured":"Van Hentenryck, P., & Dincbas, M. (1986). Domains in logic programming. In AAAI-86."},{"key":"CR35","series-title":"Ph.D. thesis","volume-title":"D\u00e9cidabilit\u00e9 et complexit\u00e9 de syst\u00e8mes de constraintes ensemblistes","author":"M. Hibti","year":"1995","unstructured":"Hibti, M. (1995). D\u00e9cidabilit\u00e9 et complexit\u00e9 de syst\u00e8mes de constraintes ensemblistes. Ph.D. thesis, Universit\u00e9 de Franche-Comt\u00e9, Besan\u00e7on. In French."},{"key":"CR36","unstructured":"Hoffman, K. L., & Padberg, M. (1992). Solving airline crew-scheduling problems by branch-and-cut. Technical Report 376, George Mason and New York University."},{"key":"CR37","unstructured":"Holzbaur, C. (1992). Metastructures vs. attributed variables in the context of extensible unification. In PLILP'92, pages 260?268."},{"key":"CR38","doi-asserted-by":"crossref","unstructured":"Le Huitouze, S. (1990). A new datastructure for implementing extensions to prolog. In 2nd Int. Work. Programming Languages Implementation and Logic Programming, LNCS 456, pages 136?150.","DOI":"10.1007\/BFb0024181"},{"key":"CR39","doi-asserted-by":"crossref","unstructured":"Jaffar, J., & Lassez, J.-L. (1987). Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, pages 111?119.","DOI":"10.1145\/41625.41635"},{"issue":"20","key":"CR40","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., & Maher, M. J. (1994). Constraint logic programming: A survey. In Journal of Logic Programming 19(20):503?581.","journal-title":"Journal of Logic Programming"},{"key":"CR41","unstructured":"Jayaraman, B., & Plaisted, D. A. (1989). Programming with equations, subsets, and relations. In Lusk and Overbeek, editors, Proceedings of the North American Conference, pages 1051?1065."},{"key":"CR42","doi-asserted-by":"crossref","unstructured":"Kapur, D., & Narendran, P. (1986). Np-completeness of the set unification and matching problems. In CADE.","DOI":"10.1007\/3-540-16780-3_113"},{"key":"CR43","unstructured":"Kowalski, R. A. (1974). Predicate logic as a programming language. IFIP, pages 569?571."},{"key":"CR44","unstructured":"Kuper, G. (1990). Logic Programming with Sets, volume 41. Academic Press."},{"key":"CR45","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J. L. Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J. L. (1978). A language and a program for stating and solving combinatorial problems. In Artificial Intelligence 10:29?127.","journal-title":"Artificial Intelligence"},{"issue":"3?4","key":"CR46","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(93)90045-I","volume":"16","author":"J. H. M. Lee","year":"1993","unstructured":"Lee, J. H. M., & van Emden, H. (1993). Interval computation as deduction in CHIP. In Journal of Logic Programming 16(3?4): 255?276.","journal-title":"Journal of Logic Programming"},{"key":"CR47","doi-asserted-by":"crossref","unstructured":"Legeard, B., & Legros, E. (1991). Short overview of the CLPS system. In Proceedings of PULP'91.","DOI":"10.1007\/3-540-54444-5_123"},{"key":"CR48","unstructured":"Legeard, B., & Legros, E. (1992). Test de satisfaisabilit\u00e9 dans le langage de programmation en logique avec constraintes ensemblistes: CLPS. In Actes des JFPL, pages 18?34."},{"key":"CR49","unstructured":"Lindner, C. C., & Rosa, A. (1980). Topics on Steiner Systems, volume 7 of Annals of Discrete Mathematics. North Holland."},{"key":"CR50","unstructured":"Livesey, M., & Siekmann, J. (1976). Unification of sets and multisets. Memo seki-76-ii, University of St. Andrews (Scotland) and Universit\u00e2t Karlsruhe (Germany) Department of Computer Science."},{"key":"CR51","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W. (1987). Foundations of Logic Programming. Springer-Verlag.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"CR52","unstructured":"Lueneburg, H. (1989). Tools and Fundamental Constructions of Combinatorial Mathematics. Wissenschaftverlag."},{"key":"CR53","doi-asserted-by":"crossref","unstructured":"Mackworth, A. K. (1977). Consistency in networks of relations. In Artificial Intelligence.","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"CR54","doi-asserted-by":"crossref","unstructured":"Mackworth, A. K., & Freuder, E. C. (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. In Artificial Intelligence 25.","DOI":"10.1016\/0004-3702(85)90041-4"},{"key":"CR55","unstructured":"Older, W., & Vellino, A. (1993). Constraint arithmetic on real intervals. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Papers. MIT Press."},{"key":"CR56","doi-asserted-by":"crossref","unstructured":"Padberg, M. W. (1979). Covering, packing and knapsack problems. In Annals of Discrete Mathematics 4. North-Holland Publishing Company.","DOI":"10.1016\/S0167-5060(08)70831-8"},{"key":"CR57","unstructured":"Papadimitriou, C. H., & Steiglitz, K. (1982). COMBINATORIAL OPTIMIZATION: Algorithms and Complexity. Prentice-Hall."},{"key":"CR58","doi-asserted-by":"crossref","unstructured":"Pawlak, Z. (1991). Rough Sets: Theoretical Aspects of Reasoning about Data. In D: System theory, knowledge engineering and problem solving. Kluwer Academic Publishers.","DOI":"10.1007\/978-94-011-3534-4"},{"key":"CR59","unstructured":"Perry, K. J., Palem, K. V., MacAloon, K., & Kuper, G. M. (1986). The complexity of logic programming with sets. In Computer Science."},{"key":"CR60","unstructured":"Puget, J-F. (1992). Programmation par contraintes orient\u00e9e objet. In Proceedings of Avignon, pages 129?138."},{"key":"CR61","unstructured":"Puget, J. F. (1996). Finite set intervals. In Workshop on Set Constraints in Conjunction with CP'96."},{"key":"CR62","unstructured":"Schrijver, A. (1986). Theory of Linear and Integer Programming. Wiley-Interscience."},{"key":"CR63","unstructured":"Schwartz, J. T., Dewar, R. B., Dubinsky, E., & Schonberg, E. (1986). Programming with Sets?An Introduction to SETL. Springer-Verlag."},{"key":"CR64","doi-asserted-by":"crossref","unstructured":"Shmueli, O., Tsur, S., & Zaniolo, C. (1992). Compilation of set terms in the logic data language (LDL). The Journal of Logic Programming 12(12).","DOI":"10.1016\/0743-1066(92)90040-A"},{"key":"CR65","doi-asserted-by":"crossref","unstructured":"Stolzenburg, F. (1996). Membership-constraints and complexity in logic programming with sets. In Franz Baader and Klaus U. Schulz, editors, Frontiers in Combining Systems. Kluwer Academic.","DOI":"10.1007\/978-94-009-0349-4_15"},{"key":"CR66","doi-asserted-by":"crossref","unstructured":"Turner, D. (1986). An Overview of Miranda 21(12). SIGPLAN Notices.","DOI":"10.1145\/15042.15053"},{"key":"CR67","unstructured":"Oxford University Computing Laboratory. (1986). Z Handbook."},{"key":"CR68","unstructured":"Walinsky, C. (1989). CLP(?*): Constraint logic programming with regular sets. In ICLP'89, pages 181?190."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00137870.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00137870\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00137870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:11:29Z","timestamp":1585933889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00137870"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF00137870"],"URL":"https:\/\/doi.org\/10.1007\/bf00137870","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}