{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:24:42Z","timestamp":1725809082258},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135595"},{"type":"electronic","value":"9783319135601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13560-1_63","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T05:24:07Z","timestamp":1415942647000},"page":"795-808","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning about Constraint Models"],"prefix":"10.1007","author":[{"given":"Christian","family":"Bessiere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Katsirelos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeynep","family":"Kiziltan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"Gent, I., Walsh, T.: CSPLib: a benchmark library for constraints. Technical report APES-09-1999 (1999), A shorter version appears in Jaffar, J. (ed.): CP 1999. LNCS, vol.\u00a01713, pp. 480\u2013481. Springer, Heidelberg (1999)","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"63_CR2","unstructured":"Geelen, P.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of the 10th ECAI, European Conference on Artificial Intelligence, pp. 31\u201335 (1992)"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1009894810205","volume":"4","author":"B. Cheng","year":"1999","unstructured":"Cheng, B., Choi, K., Lee, J., Wu, J.: Increasing constraint propagation by redundant modeling: an experience report. Constraints\u00a04, 167\u2013192 (1999)","journal-title":"Constraints"},{"key":"63_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45653-8_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Walsh","year":"2001","unstructured":"Walsh, T.: Permutation problems and channelling constraints. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 377\u2013391. Springer, Heidelberg (2001)"},{"key":"63_CR5","unstructured":"Smith, B., Stergiou, K., Walsh, T.: Using auxiliary variables and implied constraints to model non-binary problems. In: Proceedings of the 16th National Conference on AI, Association for Advancement of Artificial Intelligence, pp. 182\u2013187 (2000)"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"Gent, I., Petrie, K., Puget, J.F.: Symmetry in constraint programming. In: Handbook for Constraint Programming. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80014-3"},{"key":"63_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/11889205_46","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"T. Walsh","year":"2006","unstructured":"Walsh, T.: General symmetry breaking constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 650\u2013664. Springer, Heidelberg (2006)"},{"key":"63_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/11564751_37","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J.-F. Puget","year":"2005","unstructured":"Puget, J.-F.: Breaking all value symmetries in surjection problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 490\u2013504. Springer, Heidelberg (2005)"},{"key":"63_CR9","unstructured":"Walsh, T.: Symmetry breaking using value precedence. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) 17th European Conference on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, vol.\u00a0141, pp. 168\u2013172. IOS Press (2006)"},{"key":"63_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1007\/978-3-540-74970-7_67","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"T. Walsh","year":"2007","unstructured":"Walsh, T.: Breaking value symmetry. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 880\u2013887. Springer, Heidelberg (2007)"},{"key":"63_CR11","unstructured":"Crawford, J., Ginsberg, M., Luks, G., Roy, A.: Symmetry breaking predicates for search problems. In: Proceedings of the 5th International Conference on Knowledge Representation and Reasoning (KR 1996), pp. 148\u2013159 (1996)"},{"key":"63_CR12","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Proceedings of the 19th National Conference on AI, Association for Advancement of Artificial Intelligence (2004)"},{"key":"63_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-15396-9_26","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"G. Katsirelos","year":"2010","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: On the complexity and completeness of static constraints for breaking row and column symmetry. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 305\u2013320. Springer, Heidelberg (2010)"},{"key":"63_CR14","unstructured":"Walsh, T.: Breaking value symmetry. In: Fox, D., Gomes, C. (eds.) Proceedings of the 23rd National Conference on AI, Association for Advancement of Artificial Intelligence, pp. 1585\u20131588 (2008)"},{"key":"63_CR15","doi-asserted-by":"crossref","unstructured":"Heule, M., Walsh, T.: Symmetry within solutions. In: Proceedings of the 24th National Conference on AI, Association for Advancement of Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7549"},{"key":"63_CR16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1613\/jair.1351","volume":"21","author":"B. Hnich","year":"2004","unstructured":"Hnich, B., Walsh, T., Smith, B.: Dual modelling of permutation and injection problems. J. Artif. Intell. Res. (JAIR)\u00a021, 357\u2013391 (2004)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"63_CR17","unstructured":"Kilby, P., Slaney, J., Thiebaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proceedings of the 20th National Conference on AI, Association for Advancement of Artificial Intelligence (2005)"},{"key":"63_CR18","unstructured":"Slaney, J., Walsh, T.: Backbones in optimization and approximation. In: Proceedings of 17th IJCAI, International Joint Conference on Artificial Intelligence (2001)"},{"key":"63_CR19","unstructured":"Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In: Proceedings of the 17th International Conference on AI, International Joint Conference on Artificial Intelligence, pp. 248\u2013253 (2001)"},{"key":"63_CR20","unstructured":"Kilby, P., Slaney, J., Walsh, T.: The backbone of the travelling salesperson. In: IJCAI, pp. 175\u2013180 (2005)"},{"issue":"5","key":"63_CR21","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1142\/S0129054107005066","volume":"18","author":"V. Halava","year":"2007","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Undecidability bounds for integer matrices using clause instances. Int. J. Found. Comput. Sci.\u00a018(5), 931\u2013948 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2-4","key":"63_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0096-0551(01)00010-8","volume":"26","author":"M. Cadoli","year":"2000","unstructured":"Cadoli, M., Ianni, G., Palopoli, L., Schaerf, A., Vasile, D.: NP-Spec: an executable specification language for solving all problems in NP. Comput. Lang.\u00a026(2-4), 165\u2013195 (2000)","journal-title":"Comput. Lang."},{"key":"63_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11527862_12","volume-title":"Abstraction, Reformulation and Approximation","author":"T. Mancini","year":"2005","unstructured":"Mancini, T., Cadoli, M.: Detecting and breaking symmetries by reasoning on problem specifications. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol.\u00a03607, pp. 165\u2013181. Springer, Heidelberg (2005)"},{"key":"63_CR24","doi-asserted-by":"crossref","unstructured":"Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. Applied Artificial Intelligence 21(4&5), 383\u2013404 (2007)","DOI":"10.1080\/08839510701252650"},{"key":"63_CR25","unstructured":"Baumgartner, P., Slaney, J.: Constraint modelling: A challenge for first order automated reasoning. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP 2009), vol. 556, pp. 4\u201318. CEUR (2009)"},{"key":"63_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-68155-7_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Mears","year":"2008","unstructured":"Mears, C., Garcia de la Banda, M., Wallace, M., Demoen, B.: A novel approach for detecting symmetries in CSP models. In: Perron, L., Trick, M. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 158\u2013172. Springer, Heidelberg (2008)"},{"key":"63_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-642-23786-7_45","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"C. Mears","year":"2011","unstructured":"Mears, C., Niven, T., Jackson, M., Wallace, M.: Proving symmetries by model transformation. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 591\u2013605. Springer, Heidelberg (2011)"},{"key":"63_CR28","unstructured":"Frisch, A., Grum, M., Jefferson, C., Hern\u00e1ndez, B.M., Miguel, I.: The design of essence: A constraint language for specifying combinatorial problems. In: Veloso, M. (ed.) Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 80\u201387 (2007)"},{"key":"63_CR29","doi-asserted-by":"crossref","unstructured":"Akgun, O., Miguel, I., Jefferson, C., Frisch, A., Hnich, B.: Extensible automated constraint modelling. In: Burgard, W., Roth, D. (eds.) Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011). AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.7820"},{"key":"63_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/11564751_36","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J.-F. Puget","year":"2005","unstructured":"Puget, J.-F.: Automatic detection of variable and value symmetries. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 475\u2013489. Springer, Heidelberg (2005)"},{"key":"63_CR31","unstructured":"Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) 17th European Conference on Artificial Intelligence (ECAI 2006). Frontiers in Artificial Intelligence and Applications, vol.\u00a0141, pp. 73\u201377. IOS Press (2006)"},{"key":"63_CR32","unstructured":"Rossi, F., Petrie, C., Dhar, V.: On the equivalence of constraint satisfaction problems. In: Proceedings of the 9th European Conference on Artificial Intelligence (ECAI 1990), pp. 550\u2013556 (1990)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2014: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13560-1_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T23:56:54Z","timestamp":1689638214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13560-1_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135595","9783319135601"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13560-1_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}