{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:37Z","timestamp":1725664357309},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615514"},{"type":"electronic","value":"9783540706205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61551-2_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:57:25Z","timestamp":1330275445000},"page":"91-103","source":"Crossref","is-referenced-by-count":20,"title":["Speeding up constraint propagation by redundant modeling"],"prefix":"10.1007","author":[{"given":"B. M. W.","family":"Cheng","sequence":"first","affiliation":[]},{"given":"J. H. M.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"J. C. K.","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"P. Baptiste and C. Le Pape. Disjunctive constraints for manufacturing scheduling: Principles and extensions. In Proceedings of the Third International Conference on Computer Integrated Manufacturing, Singapore, 1995.","DOI":"10.1080\/095119296131616"},{"issue":"7","key":"7_CR2","first-page":"57","volume":"17","author":"N. Beldiceanu","year":"1994","unstructured":"N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling, 17(7):57\u201373, 1994.","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"J. Bitner","year":"1985","unstructured":"J. Bitner and E.M. Reingold. Backtrack programming techniques. Communications of the ACM, 18:651\u2013655, 1985.","journal-title":"Communications of the ACM"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"B.M.W. Cheng, J.H.M. Lee, and J.C.K. Wu. A constraint-based nurse rostering system using a redundant modeling approach. Technical report (submitted to the 8th IEEE International Conference on Tools with Artificial Intelligence), Department of Computer Science and Engineering, The Chinese University of Hong Kong, 1996.","DOI":"10.1109\/TAI.1996.560444"},{"key":"7_CR5","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, 1990."},{"key":"7_CR6","unstructured":"M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In Proceedings of the European Conference on Artificial Intelligence, pages 290\u2013295, 1988."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, and T. Graf. Applications of CHIP to industrial and engineering problems. In Proceedings of the 1st International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, pages 887\u2013892, 1988.","DOI":"10.1145\/55674.55703"},{"key":"7_CR8","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 (FGCS'88), pages 693\u2013702, Tokyo, Japan, December 1988."},{"key":"7_CR9","unstructured":"C. Gervet. Conjunto: Constraint logic programming with finite set domains. In Logic Programming: Proceedings of the 1994 International Symposium, pages 339\u2013358, 1994."},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"R.M. Haralick and G.L. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263\u2013313, 1980.","journal-title":"Artificial Intelligence"},{"key":"7_CR11","unstructured":"ILOG. ILOG: Solver Reference Manual Version 3.0, 1995."},{"key":"7_CR12","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"V. Kumar. Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13:32\u201344, 1992.","journal-title":"AI Magazine"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape Le","year":"1994","unstructured":"C. Le Pape. Implementation of resource constraints in Ilog schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering, 3:55\u201366, 1994.","journal-title":"Intelligent Systems Engineering"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"C. Le Pape. Resource constraints in a library for constraint-based scheduling. In Proceedings of the INRIA\/IEEE Conference on Emerging Technologies and Factory Automation, Paris, France, 1995.","DOI":"10.1109\/ETFA.1995.496781"},{"key":"7_CR15","unstructured":"J. Liu and K. Sycara. Emergent constraint satisfaction through multi-agent coordinated interaction. In Proceedings of MAAMAW'93, Neuchatel, Switzerland, 1993."},{"issue":"1","key":"7_CR16","first-page":"99","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth. Consistency in networks of relations. AI Journal, 8(1):99\u2013118, 1977.","journal-title":"AI Journal"},{"issue":"1","key":"7_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S0218213095000061","volume":"4","author":"P. Marti","year":"1995","unstructured":"P. Marti and M. Rueher. A distributed cooperating constraints solving system. International Journal on Artificial Intelligence Tools, 4(1&2):93\u2013113, 1995.","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling. Artificial Intelligence, 58:161\u2013205, 1992.","journal-title":"Artificial Intelligence"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","volume":"5","author":"B.A. Nadel","year":"1989","unstructured":"B.A. Nadel. Constraint satisfaction algorithms. Computational Intelligence, 5:188\u2013224, 1989.","journal-title":"Computational Intelligence"},{"issue":"3","key":"7_CR20","first-page":"537","volume":"7","author":"M. Perrett","year":"1991","unstructured":"M. Perrett. Using constraint logic programming techniques in container port planning. ICL Technical Journal, 7(3):537\u2013545, May 1991.","journal-title":"ICL Technical Journal"},{"key":"7_CR21","unstructured":"E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993."},{"key":"7_CR22","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, 1989."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61551-2_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:46:22Z","timestamp":1640929582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61551-2_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615514","9783540706205"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-61551-2_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}