{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:54:33Z","timestamp":1752461673513},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591559"},{"type":"electronic","value":"9783540492009"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59155-9_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:03:56Z","timestamp":1330275836000},"page":"293-316","source":"Crossref","is-referenced-by-count":28,"title":["Design, implementation, and evaluation of the constraint language cc(FD)"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Hentenryck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Saraswat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"15_CR1","unstructured":"A. Aggoun and N. Beldiceanu. Extending CHIP To Solve Complex Scheduling and Packing Problems. In Journ\u00e9es Francophones De Programmation Logique, Lille, France, 1992."},{"key":"15_CR2","volume-title":"PhD thesis, Fakultaet fuer Mathematik und Informatik","author":"M. Bartusch","year":"1983","unstructured":"M. Bartusch. Optimierung von Netzplaenen mit Anordnungsbeziehungen bei Knappen Betriebsmitteln. PhD thesis, Fakultaet fuer Mathematik und Informatik, Universitaet Passau (F.R.G), 1983."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0747-7171(87)80065-2","volume":"4","author":"W. Buttner","year":"1987","unstructured":"W. Buttner and H. Simonis. Embedding Boolean Expressions into Logic Programming. Journal of Symbolic Computation, 4:191\u2013205, October 1987.","journal-title":"Journal of Symbolic Computation"},{"issue":"4","key":"15_CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1051\/ro\/1978120403331","volume":"12","author":"J. Carlier","year":"1978","unstructured":"J. Carlier. Ordonnancement \u00e1 Constraintes Disjonctives. RAIRO Operations Research, 12(4):333\u2013351, November 1978.","journal-title":"RAIRO Operations Research"},{"key":"15_CR5","volume-title":"Technical Report ISSN 0294\u20132755","author":"J. Carlier","year":"1986","unstructured":"J. Carlier and E. Pinson. Une M\u00e9thode Arborescente pour Optimiser la Dur\u00e9e d'un JOB-SHOP. Technical Report ISSN 0294\u20132755, I.M.A, Angers, 1986."},{"key":"15_CR6","unstructured":"M. Carlsson. Freeze, Indexing and Other Implemenation Issues on the WAM. In J-L. Lassez, editor, Fourth International Conference on Logic Programming, pages 40\u201358, Melbourne, Australia, 1987."},{"key":"15_CR7","volume-title":"Report SCE-90-05","author":"J.W. Chinneck","year":"1990","unstructured":"J.W. Chinneck, R.A. Goubran, G.M. Karam, and M. Lavoie. A Design Approach for Real-Time Multiprocessor DSP Applications. Report SCE-90-05, Carleton University, Ottawa, Canada, February 1990."},{"key":"15_CR8","volume-title":"Graph Theory: An Algorithmic Approach","author":"N. Christofides","year":"1975","unstructured":"N. Christofides. Graph Theory: An Algorithmic Approach. Academic Press, New York, 1975."},{"issue":"4","key":"15_CR9","first-page":"412","volume":"28","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer. An Introduction to Prolog III. CACM, 28(4):412\u2013418, 1990.","journal-title":"CACM"},{"issue":"3","key":"15_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1051\/ro\/1984180302111","volume":"18","author":"M.C. Costa","year":"1984","unstructured":"M.C. Costa. Une Etude Pratique de d\u00e9coupes de Panneaux de Bois. RAIRO Recherche Operationnelle, 18(3):211\u2013219, August 1984.","journal-title":"RAIRO Recherche Operationnelle"},{"key":"15_CR11","unstructured":"T. Dean and M. Boddy. An Analysis of Time-dependent Planning. In Proceedings of the Seventh National Conference On Artificial Intelligence, pages 49\u201354, Minneapolis, Minnesota, August 1988."},{"key":"15_CR12","unstructured":"M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving the Car Sequencing Problem in Constraint Logic Programming. In European Conference on Artificial Intelligence (ECAI-88), Munich, W. Germany, August 1988."},{"issue":"l\u20132","key":"15_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0743-1066(90)90052-7","volume":"8","author":"M. Dincbas","year":"1990","unstructured":"M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving Large Combinatorial Problems in Logic Programming. Journal of Logic Programming, 8(l\u20132):75\u201393, January\/March 1990.","journal-title":"Journal of Logic Programming"},{"key":"15_CR14","unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, December 1988."},{"key":"15_CR15","volume-title":"Internal Report","author":"T. Graf","year":"1987","unstructured":"T. Graf. Extending Constraint Handling in Logic Programming to Rational Arithmetic. Internal Report, ECRC, Munich, Septembre 1987."},{"key":"15_CR16","unstructured":"T. Graf, P. Van Hentenryck, C. Pradelles, and L. Zimmer. Simulation of Hybrid Circuits in Constraint Logic Programming. In International Joint Conference on Artificial Intelligence, Detroit, Michigan, August 1989."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J-L. Lassez. Constraint Logic Programming. In POPL-87, Munich, FRG, January 1987.","DOI":"10.1145\/41625.41635"},{"key":"15_CR18","unstructured":"J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In Fourth International Conference on Logic Programming, pages 196\u2013218, Melbourne, Australia, May 1987."},{"issue":"4","key":"15_CR19","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28","author":"M. Kubale","year":"1985","unstructured":"M. Kubale and D. Jackowski. A Generalized Implicit Enumeration Algorithm for Graph Coloring. CACM, 28(4):412\u2013418, 1985.","journal-title":"CACM"},{"key":"15_CR20","volume-title":"Master's Thesis","author":"M. Lavoie","year":"1990","unstructured":"Marco Lavoie. Task Assignment in a DSP Multiprocessor Environment. Master's Thesis, Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, August 1990."},{"issue":"1","key":"15_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"15_CR22","unstructured":"M.J. Maher. Logic Semantics for a Class of Committed-Choice Programs. In Fourth International Conference on Logic Programming, pages 858\u2013876, Melbourne, Australia, May 1987."},{"key":"15_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"R. Mohr and T.C. Henderson. Arc and Path Consistency Revisited. Artificial Intelligence, 28:225\u2013233, 1986.","journal-title":"Artificial Intelligence"},{"key":"15_CR24","volume-title":"Industrial Scheduling","author":"J.F. Muth","year":"1963","unstructured":"J.F. Muth and G.L. Thompson. Industrial Scheduling. Prentice Hall, Englewood Cliffs, NJ, 1963."},{"key":"15_CR25","volume-title":"Discrete Optimization","author":"R.G. Parker","year":"1988","unstructured":"R.G. Parker and R.L. Rardin. Discrete Optimization. Academic Press, London (England), 1988."},{"issue":"l","key":"15_CR26","first-page":"60","volume":"3","author":"B.D. Parrello","year":"1988","unstructured":"B.D. Parrello. CAR WARS: The (Almost) Birth of an Expert System. AI Expert, 3(l):60\u201364, January 1988.","journal-title":"AI Expert"},{"key":"15_CR27","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1287\/opre.18.3.549","volume":"18","author":"H.M. Salkin","year":"1970","unstructured":"H.M. Salkin. On the Merit of the Generalized Origin and Restarts in Implicit Enumeration. Opns. Res., 18:549\u2013554, 1970.","journal-title":"Opns. Res."},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, 1989.","DOI":"10.1145\/96709.96733"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat and M. Rinard. Concurrent Constraint Programming. In Proceedings of Seventeenth ACM Symposium on Principles of Programming Languages, San Francisco, CA, January 1990.","DOI":"10.1145\/96709.96733"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic Foundations of Concurrent Constraint Programming. In Proceedings of Ninth ACM Symposium on Principles of Programming Languages, Orlando, FL, January 1991.","DOI":"10.1145\/99583.99627"},{"key":"15_CR31","series-title":"Logic Programming Series","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck Van","year":"1989","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series, The MIT Press, Cambridge, MA, 1989."},{"key":"15_CR32","unstructured":"P. Van Hentenryck. Scheduling and Packing in the Constraint Language cc(FD). Technical Report CS-92-43, CS Department, Brown University, 1992."},{"key":"15_CR33","unstructured":"P. Van Hentenryck and Y. Deville. The Cardinality Operator: A New Logical Connective and Its Application to Constraint Logic Programming. In Eighth International Conference on Logic Programming (ICLP-91), Paris (France), June 1991. Also to appear in Constraint Logic Programming: Selected Research, The MIT Press, 1992."},{"key":"15_CR34","unstructured":"P. Van Hentenryck, Y. Deville, M.L. Chen, and C.M. Teng. New Results in Consistency of Networks. Technical report, CS Department, Brown University, 1992. Forthcoming."},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, Y. Deville, and C.M. Teng. A Generic Arc Consistency Algorithm and its Specializations. Artificial Intelligence, 57(2\u20133), 1992.","DOI":"10.1016\/0004-3702(92)90020-X"},{"issue":"2\u20134","key":"15_CR36","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01543480","volume":"5","author":"P. Hentenryck Van","year":"1992","unstructured":"P. Van Hentenryck and T. Graf. Standard Forms for Rational Linear Arithmetics in Constraint Logic Programming. Annals of Mathematics and Artificial Intelligence, 5(2\u20134):303\u2013320, 1992.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"15_CR37","unstructured":"D.H.D Warren. An Abstract Prolog Instruction Set. Technical Report 309, SRI, October 1983."}],"container-title":["Lecture Notes in Computer Science","Constraint Programming: Basics and Trends"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59155-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:40Z","timestamp":1605648340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59155-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591559","9783540492009"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-59155-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}