{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:57:11Z","timestamp":1772668631145,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540251767","type":"print"},{"value":"9783540322528","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11402763_8","type":"book-chapter","created":{"date-parts":[[2005,10,21]],"date-time":"2005-10-21T15:15:23Z","timestamp":1129907723000},"page":"98-112","source":"Crossref","is-referenced-by-count":9,"title":["Automatically Exploiting Symmetries in Constraint Programming"],"prefix":"10.1007","author":[{"given":"Arathi","family":"Ramani","sequence":"first","affiliation":[]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"8_CR1","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1109\/TCAD.2003.816218","volume":"22","author":"F.A. Aloul","year":"2003","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving Difficult SAT Instances In The Presence of Symmetry. IEEE Transactions on CAD\u00a022(9), 1117\u20131137 (2003)","journal-title":"IEEE Transactions on CAD"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Generic ILP versus Specialized 0-1 ILP: An Update. In: Proceedings of the International Conference on Computer-Aided Design, pp. 450\u2013457 (2002)","DOI":"10.1145\/774572.774638"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability. In: Proc. Intl. Joint Conf. on AI, pp. 271\u2013282 (2003)","DOI":"10.1145\/776038.776042"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Symmetry-Breaking for Pseudo- Boolean Formulas. In: Proceedings of the Asia-South Pacific Design Automation Conference, pp. 884\u2013887 (2004)","DOI":"10.1109\/ASPDAC.2004.1337720"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF Encoding of Boolean Cardinality Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"key":"8_CR6","unstructured":"Bailleux, O., Boufkhad, Y.: Full CNF Encoding: The Counting Constraints Case. In: 7th Intl. Conf. on Theory and Applications of SAT Testing (2004)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-boolean constraint solver. In: Proceedings of the Design Automation Conference, pp. 830\u2013835 (2003)","DOI":"10.1145\/776038.776041"},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9781420049954","volume-title":"The CRC Handbook of Combinatorial Designs","author":"C.H. Colbourn","year":"1996","unstructured":"Colbourn, C.H., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996)"},{"key":"8_CR9","unstructured":"Crawford, J., Ginsburg, M., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proc. of the Intl. Conf. on Principles of Knowledge Representation and Reasoning, pp. 148\u2013159 (1996)"},{"key":"8_CR10","unstructured":"Darga, P.: SAUCY Man Page, http:\/\/vlsicad.eecs.umich.edu\/BK\/SAUCY\/"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Frisch, A.M., Miguel, I., Walsh, T.: Cgrass: A System for Transforming Constraint Satisfaction Problems. In: Jt. Workshop of ERCIM\/CologNet area on Constr. Solving and Constr. Logic Prog., pp. 23\u201326 (2002)","DOI":"10.1007\/3-540-36607-5_2"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-45193-8_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"I.P. Gent","year":"2003","unstructured":"Gent, I.P., Harvey, W., Kelsey, T., Linton, S.: Generic SBDD using Computational Group Theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 333\u2013347. Springer, Heidelberg (2003)"},{"key":"8_CR13","unstructured":"Gent, I.P., Walsh, T., Selman, B.: CSPLib Problem Library for Constraints, http:\/\/www.csplib.org"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Kiziltan, Z.: Symmetry Breaking Ordering Constraints, Doctoral Thesis, Uppsala University (2004)","DOI":"10.1007\/978-3-540-45193-8_103"},{"key":"8_CR15","unstructured":"Lal, A., Choueiry, B.: Dynamic Detection and Exploitation of Value Symmetries for Non- Binary Finite CSPs. In: Workshop on Symmetry in CSPs (2003)"},{"key":"8_CR16","first-page":"45","volume":"30","author":"B. McKay","year":"1981","unstructured":"McKay, B.: Practical Graph Isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F. Margot","year":"2003","unstructured":"Margot, F.: Exploiting Orbits in Symmetric ILP. Mathematical Programming Ser. B\u00a098, 3\u201321 (2003)","journal-title":"Mathematical Programming Ser. B"},{"key":"8_CR18","unstructured":"Meseguer, P., Torras, C.: Solving strategies for highly symmetric CSPs. In: Proceedings IJCAI, pp. 400\u2013405 (1999)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. Design Automation Conf., pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Nam, G., Aloul, F., Sakallah, K., Rutenbar, R.: A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints. In: Proc. of the Intl. Symposium on Physical Design, pp. 222\u2013227 (2001)","DOI":"10.1145\/369691.369777"},{"key":"8_CR21","volume-title":"The OPL Optimization Programming Language","author":"P. Hentenryck van","year":"1999","unstructured":"van Hentenryck, P.: The OPL Optimization Programming Language. The MIT Press, Cambridge (1999)"},{"key":"8_CR22","unstructured":"The ECLiPSe Team, The ECLiPSe Constraint Logic Programming System, http:\/\/www.icparc.ic.ac.uk\/eclipse\/"},{"key":"8_CR23","unstructured":"Prestwich, S.D.: Balanced Incomplete Block Design as Satisfiability. In: 12th Irish Conference on Artificial Intelligence and Cognitive Science (2001)"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-540-45193-8_40","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"J.F. Puget","year":"2003","unstructured":"Puget, J.F.: Symmetry Breaking Using Stabilizers. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 585\u2013599. Springer, Heidelberg (2003)"},{"key":"8_CR25","unstructured":"Sheini, H.: The Pueblo solver, http:\/\/www.eecs.umich.edu\/~hsheini\/pueblo"},{"key":"8_CR26","unstructured":"Ramani, A., Markov, I.L.: GSymEx: Generic Symmetry Extraction for Constraint Programming Problems, http:\/\/vlsicad.eecs.umich.edu\/BK\/GSymEx\/"},{"key":"8_CR27","unstructured":"ILOG Solver, http:\/\/www.ilog.com\/products\/solver\/"},{"issue":"2","key":"8_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"J.P. Warners","year":"1998","unstructured":"Warners, J.P.: A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form. Information Proc. Letters\u00a068(2), 63\u201369 (1998)","journal-title":"Information Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11402763_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T04:28:24Z","timestamp":1736051304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11402763_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540251767","9783540322528"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11402763_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}