{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:34:48Z","timestamp":1725521688733},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540891963"},{"type":"electronic","value":"9783540891970"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89197-0_25","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T07:23:50Z","timestamp":1228289030000},"page":"247-259","source":"Crossref","is-referenced-by-count":4,"title":["Finding Orthogonal Arrays Using Satisfiability Checkers and Symmetry Breaking Constraints"],"prefix":"10.1007","author":[{"given":"Feifei","family":"Ma","sequence":"first","affiliation":[]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Aloul, F.: The PBS Page, \n                    \n                      http:\/\/www.eecs.umich.edu\/~faloul\/Tools\/pbs\/"},{"issue":"1\u20133","key":"25_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.disc.2003.11.022","volume":"284","author":"F.E. Bennett","year":"2004","unstructured":"Bennett, F.E., Zhang, H.: Latin Squares with Self-Orthogonal Conjugates. Discrete Mathematics\u00a0284(1\u20133), 45\u201355 (2004)","journal-title":"Discrete Mathematics"},{"key":"25_CR3","volume-title":"Pragmatic Software Testing","author":"R. Black","year":"2007","unstructured":"Black, R.: Pragmatic Software Testing. Wiley, Chichester (2007)"},{"issue":"9","key":"25_CR4","doi-asserted-by":"publisher","first-page":"3268","DOI":"10.1016\/j.jspi.2004.12.012","volume":"136","author":"A.E. Brouwer","year":"2006","unstructured":"Brouwer, A.E., Cohen, A.M., Nguyen, M.V.M.: Orthogonal Arrays of Strength 3 and Small Run Sizes. J. Statistical Planning and Inf.\u00a0136(9), 3268\u20133280 (2006)","journal-title":"J. Statistical Planning and Inf."},{"key":"25_CR5","volume-title":"Handbook of Combinatorial Designs","author":"C.J. Colbourn","year":"2007","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007)","edition":"2"},{"key":"25_CR6","unstructured":"E\u00e9n, N., Sorensson, N.: The MiniSat Page, \n                    \n                      http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat\/"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer Series in Statistics (1999)","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-46135-3_31","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"P. Flener","year":"2002","unstructured":"Flener, P., et al.: Breaking Row and Column Symmetries in Matrix Models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 462\u2013476. Springer, Heidelberg (2002)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1241572.1241582","volume":"32","author":"R. Krishnan","year":"2007","unstructured":"Krishnan, R., et al.: Combinatorial Testing: Learnings from Our Experience. ACM SIGSOFT Softw. Eng. Notes\u00a032(3), 1\u20138 (2007)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"issue":"2-3","key":"25_CR10","doi-asserted-by":"publisher","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.: Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction. Constraints\u00a011(2-3), 221\u2013267 (2006)","journal-title":"Constraints"},{"key":"25_CR11","unstructured":"Ma, F., Zhang, J.: Seaching for Orthogonal Arrays. ISCAS-LCS-07-05 (2007)"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/j.1538-7305.1992.tb00164.x","volume":"71","author":"B. Robert","year":"1992","unstructured":"Robert, B., Prowse, J., Phadke, M.S.: Robust Testing of AT&T PMX\/Star MAIL using OATS. AT&T Technical Journal\u00a071(3), 41\u201347 (1992)","journal-title":"AT&T Technical Journal"},{"key":"25_CR13","unstructured":"Snepvangers, R.: Statistical Designs for High-Throughput Experimentation. Technical report, Stan Ackermans Institute (August 2006)"},{"key":"25_CR14","unstructured":"Walsh, T.: Symmetry Breaking using Value Precedence. In: Proc. ECAI 2006, pp. 168\u2013172 (2006)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1198\/004017002188618554","volume":"44","author":"H. Xu","year":"2002","unstructured":"Xu, H.: An Algorithm for Constructing Orthogonal and Nearly-orthogonal Arrays with Mixed Levels and Small Runs. Technometrics\u00a044, 356\u2013368 (2002)","journal-title":"Technometrics"},{"key":"25_CR16","first-page":"71","volume":"23","author":"S. Yamamoto","year":"1998","unstructured":"Yamamoto, S., et al.: Algorithm for the Construction and Classification of Orthogonal Arrays and Its Feasibility. J. Combin. Inform. System Sci.\u00a023, 71\u201384 (1998)","journal-title":"J. Combin. Inform. System Sci."},{"key":"#cr-split#-25_CR17.1","doi-asserted-by":"crossref","unstructured":"Yan, J., Zhang, J.: Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing. In: Proceedings of COMPSAC, pp. 385???394 (2006);","DOI":"10.1109\/COMPSAC.2006.33"},{"key":"#cr-split#-25_CR17.2","unstructured":"Extended version, to appear J. of Systems and Software"},{"key":"25_CR18","unstructured":"Zhang, J., Zhang, H.: SEM: A System for Enumerating Models. In: Proceedings of IJCAI 1995, pp. 298\u2013303 (1995)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2008: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89197-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T02:54:21Z","timestamp":1551668061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89197-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540891963","9783540891970"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89197-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}