{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:25:39Z","timestamp":1725513939155},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727873"},{"type":"electronic","value":"9783540727880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72788-0_6","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T12:25:22Z","timestamp":1183033522000},"page":"22-27","source":"Crossref","is-referenced-by-count":3,"title":["Breaking Symmetries in SAT Matrix Models"],"prefix":"10.1007","author":[{"given":"In\u00eas","family":"Lynce","sequence":"first","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1109\/TCAD.2003.816218","volume":"22","author":"F.A. Aloul","year":"2003","unstructured":"Aloul, F.A., et al.: Solving difficult instances in the presence of symmetry. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a022(9), 1117\u20131137 (2003)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"6_CR2","unstructured":"Crawford, J.M., et al.: Symmetry-breaking predicates for search problems. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (1996)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"A.M. Frisch","year":"2002","unstructured":"Frisch, A.M., et al.: Breaking Row and Column Symmetries in Matrix Models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, Springer, Heidelberg (2002)"},{"key":"6_CR4","unstructured":"Lynce, I., Marques-Silva, J.: Efficient haplotype inference with Boolean satisfiability. In: National Conference on Artificial Intelligence (AAAI) (2006)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","first-page":"136","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"J. Marques-Silva","year":"2006","unstructured":"Marques-Silva, J., Lynce, I.: SAT in Bioinformatics: Making the Case with Haplotype Inference. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 136\u2013141. Springer, Heidelberg (2006)"},{"key":"6_CR6","unstructured":"Prestwich, S.: First-solution search with symmetry breaking and implied constraints. In: CP Workshop on Modelling and Problem Formulation (2001)"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1613\/jair.1637","volume":"26","author":"A. Ramani","year":"2006","unstructured":"Ramani, A., et al.: Breaking instance-independent symmetries in exact graph coloring. Journal of Artificial Intelligence Research\u00a026, 289\u2013322 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. In: LICS Workshop on Theory and Applications of Satisfiability Testing (2001)","DOI":"10.1016\/S1571-0653(04)00311-7"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72788-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:14Z","timestamp":1605762314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72788-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727873","9783540727880"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72788-0_6","relation":{},"subject":[]}}