{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:26:55Z","timestamp":1648524415480},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T00:00:00Z","timestamp":1186444800000},"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":[[2007,10,4]]},"DOI":"10.1007\/s10601-007-9024-x","type":"journal-article","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:44:00Z","timestamp":1186425840000},"page":"469-505","source":"Crossref","is-referenced-by-count":4,"title":["Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems"],"prefix":"10.1007","volume":"12","author":[{"given":"Yat Chiu","family":"Law","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jimmy H. M.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara M.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,7]]},"reference":[{"key":"9024_CR1","unstructured":"Ans\u00f3tegui, C., & Many\u00e0, F. (2004). Mapping problems with finite-domain variables into problems with Boolean variables. In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (pp. 1\u201315)."},{"issue":"2","key":"9024_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","volume":"165","author":"C. Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C., Yap, R. H. C., & Zhang, Y. (2005). An optimal coarse-grained arc consistency algorithm. Artificial Intelligence, 165(2), 165\u2013185.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"9024_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/A:1009894810205","volume":"4","author":"B. M. W. Cheng","year":"1999","unstructured":"Cheng, B. M. W., Choi, K. M. F., Lee, J. H. M., & Wu, J. C. K. (1999). Increasing constraint propagation by redundant modeling: An experience report. Constraints, 4(2), 167\u2013192.","journal-title":"Constraints"},{"key":"9024_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, B. M. W., Lee, J. H. M., & Wu, J. C. K. (1996). Speeding up constraint propagation by redundant modeling. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (pp. 91\u2013103).","DOI":"10.1007\/3-540-61551-2_68"},{"key":"9024_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, K. C. K., Lee, J. H. M., & Stuckey, P. J. (2003). Box constraint collections for adhoc constraints. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (pp. 214\u2013228).","DOI":"10.1007\/978-3-540-45193-8_15"},{"key":"9024_CR6","unstructured":"Cheng, K. C. K., Lee, J. H. M., & Stuckey, P. J. (2003). Efficient representation of adhoc constraints. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (pp. 1368\u20131369)."},{"key":"9024_CR7","unstructured":"Choi, C. W., Lee, J. H. M., & Stuckey, P. J. (2003). Propagation redundancy for permutation channels. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (pp. 1370\u20131371)."},{"key":"9024_CR8","doi-asserted-by":"crossref","unstructured":"Choi, C. W., Lee, J. H. M., & Stuckey, P. J. (2003). Propagation redundancy in redundant modelling. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (pp. 229\u2013243).","DOI":"10.1007\/978-3-540-45193-8_16"},{"key":"9024_CR9","doi-asserted-by":"crossref","unstructured":"Choi, C. W., Lee, J. H. M., & Stuckey, P. J. (2007). Removing propagation redundant constraints in redundant modeling. ACM Transactions on Computational Logic, 8(4) (in press).","DOI":"10.1145\/1276920.1276925"},{"key":"9024_CR10","doi-asserted-by":"crossref","unstructured":"Dao, T. B. H., Lallouet, A., Legtchenko, A., & Martin, L. (2002). Indexical-based solver learning. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (pp. 541\u2013556).","DOI":"10.1007\/3-540-46135-3_36"},{"key":"9024_CR11","doi-asserted-by":"crossref","unstructured":"Dot\u00fa, I., del Val, A., & Cebri\u00e1n, M. (2003). Redundant modeling for the quasigroup completion problem. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (pp. 288\u2013302).","DOI":"10.1007\/978-3-540-45193-8_20"},{"key":"9024_CR12","doi-asserted-by":"crossref","unstructured":"Flener, P., Frisch, A. M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., et al. (2002). Breaking row and column symmetries in matrix models. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (pp. 462\u2013476).","DOI":"10.1007\/3-540-46135-3_31"},{"key":"9024_CR13","doi-asserted-by":"crossref","unstructured":"Flener, P., Hnich, B., & Kiziltan, Z. (2001). Compiling high-level type constructors in constraint programming. In Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages (pp. 229\u2013244).","DOI":"10.1007\/3-540-45241-9_16"},{"issue":"1\u20133","key":"9024_CR14","first-page":"143","volume":"35","author":"A. Frisch","year":"2005","unstructured":"Frisch, A., Peugniez, T., Goggett, A., & Nightingale, P. (2005). Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings. Journal of Automated Reasoning, 35(1\u20133), 143\u2013179.","journal-title":"Journal of Automated Reasoning"},{"key":"9024_CR15","unstructured":"Frisch, A. M., Grum, M., Jefferson, C., Hern\u00e1ndez, B. M., & Miguel, I. (2007). The design of Essence: A constraint language for specifying combinatorial problems. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (pp. 80\u201387)."},{"key":"9024_CR16","unstructured":"Frisch, A. M., Jefferson, C., Hern\u00e1ndez, B. M., & Miguel, I. (2005). The rules of constraint modelling. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (pp. 109\u2013116)."},{"key":"9024_CR17","unstructured":"Geelen, P. A. (1992). Dual viewpoint heuristics for binary constraint satisfaction problems. In Proceedings of the 10th European Conference on Artificial Intelligence (pp. 31\u201335)."},{"key":"9024_CR18","unstructured":"Gent, I. P. (2002). Arc consistency in SAT. In Proceedings of the 15th European Conference on Artificial Intelligence (pp. 121\u2013125)."},{"key":"9024_CR19","unstructured":"Hnich, B. (2003). Function variables for constraint programming. Ph.D. thesis, Department of Information Science, Uppsala University."},{"key":"9024_CR20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1613\/jair.1351","volume":"21","author":"B. Hnich","year":"2004","unstructured":"Hnich, B., Smith, B. M., & Walsh, T. (2004). Dual modelling of permutation and injection problems. Journal of Artificial Intelligence Research, 21, 357\u2013391.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9024_CR21","unstructured":"ILOG, S. A. (1999). ILOG Solver 4.4 Reference Manual."},{"key":"9024_CR22","unstructured":"I. S. Laboratory (2003). SICStus Prolog User\u2019s Manual. Swedish Institute of Computer Science."},{"key":"9024_CR23","unstructured":"Jourdan, J. (1995). Concurrent constraint multiple models in CLP and CC languages: Toward a programming methodology by modelling. Ph.D. thesis, Universit\u00e9 Denis Diderot, Paris VII."},{"key":"9024_CR24","unstructured":"Jourdan, J. (1995). Concurrent constraint multiple models in CLP and CC languages: Toward a programming methodology by modelling. In Proceedings of the INFORMS Conference."},{"key":"9024_CR25","unstructured":"Law, Y. C., & Lee, J. H. M. (2002). Model induction: A new source of CSP model redundancy. In Proceedings of the 18th National Conference on Artificial Intelligence (pp. 54\u201360)."},{"key":"9024_CR26","doi-asserted-by":"crossref","unstructured":"Law, Y. C., & Lee, J. H. M. (2005). Breaking value symmetries in matrix models using channeling constraints. In Proceedings of the 20th Annual ACM Symposium on Applied Computing (pp. 375\u2013380).","DOI":"10.1145\/1066677.1066764"},{"issue":"2\u20133","key":"9024_CR27","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10601-006-7095-8","volume":"11","author":"Y. C. Law","year":"2006","unstructured":"Law, Y. C., & Lee, J. H. M. (2006). Symmetry breaking constraints for value symmetries in constraint satisfaction. Constraints, 11(2\u20133), 221\u2013267.","journal-title":"Constraints"},{"key":"9024_CR28","unstructured":"Law, Y. C., Lee, J. H. M., & Smith, B. M. (2005). Generating a pair of mutually redundant random permutation CSPs. Technical report, Computer Science & Engineering, CUHK and Cork Constraint Computation Centre, UCC."},{"issue":"1","key":"9024_CR29","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"9024_CR30","doi-asserted-by":"crossref","unstructured":"Marriott, K., & Stuckey, P. J. (1998). Programming with Constraints (Chapter\u00a08, pp. 266\u2013271). The MIT Press.","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"9024_CR31","unstructured":"Mart\u00ednez-Hern\u00e1ndez, B., & Frisch, A. M. (2006). The automatic generation of redundant representations and channelling constraints. In Proceedings of the 5th International Workshop on Constraint Modelling and Reformulation (pp. 42\u201356)."},{"key":"9024_CR32","unstructured":"Rossi, F., Petrie, C., & Dhar, V. (1990). On the equivalence of constraint satisfaction problems. In Proceedings of the 9th European Conference on Artificial Intelligence (pp. 550\u2013556)."},{"key":"9024_CR33","unstructured":"Roussel, O. (2005). Some notes on the implementation of csp2sat+zchaff, a simple translator from CSP to SAT. In Proceedings of the 2nd International Workshop on Constraint Propagation and Implementation (pp. 83\u201388)."},{"key":"9024_CR34","unstructured":"Smith, B. M. (2000). Modelling a permutation problem. Technical report 2000.18, School of Computer Studies, University of Leeds."},{"key":"9024_CR35","doi-asserted-by":"crossref","unstructured":"Smith, B. M. (2001). Dual models in permutation problems. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (pp. 615\u2013619).","DOI":"10.1007\/3-540-45578-7_50"},{"issue":"1\u20132","key":"9024_CR36","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B. M. Smith","year":"1996","unstructured":"Smith, B. M., & Dyer, M. E. (1996). Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81(1\u20132), 155\u2013181.","journal-title":"Artificial Intelligence"},{"key":"9024_CR37","doi-asserted-by":"crossref","unstructured":"Walsh, T. (2000). SAT v CSP. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (pp. 441\u2013455).","DOI":"10.1007\/3-540-45349-0_32"},{"key":"9024_CR38","doi-asserted-by":"crossref","unstructured":"Walsh, T. (2001). permutation problems and channelling constraints. In Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 377\u2013391).","DOI":"10.1007\/3-540-45653-8_26"},{"key":"9024_CR39","unstructured":"Weigel, R., & Bliek, C. (1998). On reformulation of constraint satisfaction problems. In Proceedings of 13th European Conference on Artificial Intelligence (pp. 254\u2013258)."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9024-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-007-9024-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9024-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:13Z","timestamp":1559243653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-007-9024-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,7]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,4]]}},"alternative-id":["9024"],"URL":"https:\/\/doi.org\/10.1007\/s10601-007-9024-x","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,7]]}}}