{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:29:46Z","timestamp":1742941786429,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819970216"},{"type":"electronic","value":"9789819970223"}],"license":[{"start":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:00:00Z","timestamp":1699574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:00:00Z","timestamp":1699574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-7022-3_38","type":"book-chapter","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:02:57Z","timestamp":1699574577000},"page":"410-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Investigating the\u00a0Existence of\u00a0Holey Latin Squares via\u00a0Satisfiability Testing"],"prefix":"10.1007","author":[{"given":"Minghao","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuqi","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hantao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,10]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.disc.2014.11.018","volume":"338","author":"RJR Abel","year":"2015","unstructured":"Abel, R.J.R., Li, Y.: Some constructions for T pairwise orthogonal diagonal Latin squares based on difference matrices. Discrete Math. 338, 593\u2013607 (2015)","journal-title":"Discrete Math."},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: Shatter: efficient symmetry-breaking for Boolean satisfiability. In: DAC, pp. 836\u2013839 (2003)","DOI":"10.1145\/775832.776042"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(89)90348-8","volume":"77","author":"FE Bennett","year":"1989","unstructured":"Bennett, F.E.: The spectra of a variety of quasigroups and related combinatorial designs. Discrete Math. 77, 29\u201350 (1989)","journal-title":"Discrete Math."},{"key":"38_CR4","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT competition 2020. In: Proceedings of SAT Competition 2020 - Solver and Benchmark Descriptions (2020)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Bright, C., Cheung, K.K., Stevens, B., Kotsireas, I., Ganesh, V.: A SAT-based resolution of Lam\u2019s problem. In: AAAI (2021)","DOI":"10.1609\/aaai.v35i5.16483"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(84)90075-1","volume":"8","author":"CJ Colbourn","year":"1984","unstructured":"Colbourn, C.J.: The complexity of completing partial Latin squares. Discrete Appl. Math. 8, 25\u201330 (1984)","journal-title":"Discrete Appl. Math."},{"key":"38_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781003040897","volume-title":"CRC Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn, C.J.: CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2010)"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn, C.J., Klove, T., Ling, A.C.H.: Permutation arrays for powerline communication and mutually orthogonal Latin squares. IEEE Trans. Inf. Theory 50, 1289\u20131291 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-40970-2_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"J Devriendt","year":"2016","unstructured":"Devriendt, J., Bogaerts, B., Bruynooghe, M., Denecker, M.: Improved static symmetry breaking for SAT. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 104\u2013122. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_8"},{"key":"38_CR10","unstructured":"Evans, T.: Algebraic structures associated with Latin squares and orthogonal arrays. In: Proceedings of Conference on Algebraic Aspects of Combinatorics (1975)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Frisch, A.M., Peugniez, T.J., Doggett, A.J., Nightingale, P.: Solving non-Boolean satisfiability problems with stochastic local search: a comparison of encodings. J. Autom. Reason. (2005)","DOI":"10.1007\/s10817-005-9011-0"},{"key":"38_CR12","unstructured":"Fujita, M., Slaney, J.K., Bennett, F.: Automatic generation of some results in finite algebra. In: IJCAI, pp. 52\u201359 (1993)"},{"key":"38_CR13","unstructured":"Gent, I.P., Nightingale, P.: A new encoding of alldifferent into SAT. In: International Workshop on Modelling and Reformulating Constraint Satisfaction (2004) (2004)"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1037\/h0053912","volume":"45","author":"DA Grant","year":"1948","unstructured":"Grant, D.A.: The Latin square principle in the design and analysis of psychological experiments. Psychol. Bull. 45, 427 (1948)","journal-title":"Psychol. Bull."},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Heule, M.: Schur number five. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.12209"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-030-80223-3_16","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2021","author":"P Huang","year":"2021","unstructured":"Huang, P., Li, R., Liu, M., Ma, F., Zhang, J.: Efficient SAT-based minimal model generation methods for modal logic S5. In: Li, C.-M., Many\u00e0, F. (eds.) SAT 2021. LNCS, vol. 12831, pp. 225\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80223-3_16"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Huang, P., Liu, M., Ge, C., Ma, F., Zhang, J.: Investigating the existence of orthogonal golf designs via satisfiability testing. In: ISSAC (2019)","DOI":"10.1145\/3326229.3326232"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Huang, P., Liu, M., Wang, P., Zhang, W., Ma, F., Zhang, J.: Solving the satisfiability problem of modal logic S5 guided by graph coloring. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/153"},{"key":"38_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-319-94205-6_24","volume-title":"Automated Reasoning","author":"P Huang","year":"2018","unstructured":"Huang, P., Ma, F., Ge, C., Zhang, J., Zhang, H.: Investigating the existence of large sets of idempotent quasigroups via satisfiability testing. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 354\u2013369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_24"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0012-365X(84)90104-3","volume":"52","author":"CC Lindner","year":"1984","unstructured":"Lindner, C.C., Stinson, D.R.: Steiner pentagon systems. Discrete Math. 52, 67\u201374 (1984)","journal-title":"Discrete Math."},{"key":"38_CR21","first-page":"1","volume":"56","author":"F Ma","year":"2013","unstructured":"Ma, F., Zhang, J.: Finding orthogonal Latin squares using finite model searching tools. Sci. China Inf. Sci. 56, 1\u20139 (2013)","journal-title":"Sci. China Inf. Sci."},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"McCune, W.: Mace4 reference manual and guide. arXiv preprint cs\/0310055 (2003)","DOI":"10.2172\/822574"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"38_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1080\/09720529.2010.10698290","volume":"13","author":"SK Pal","year":"2010","unstructured":"Pal, S.K., Kapoor, S., Arora, A., Chaudhary, R., Khurana, J.: Design of strong cryptographic schemes based on Latin squares. J. Discrete Math. Sci. Cryptogr. 13, 233\u2013256 (2010)","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"38_CR26","doi-asserted-by":"crossref","unstructured":"Parker, E.: Computer investigation of orthogonal Latin squares of order ten. In: Proceedings of the Symposia in Applied Mathematics (1963)","DOI":"10.1090\/psapm\/015\/0180910"},{"key":"38_CR27","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0898-1221(94)00219-B","volume":"29","author":"J Slaney","year":"1995","unstructured":"Slaney, J., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: quasigroup existence problems. Comput. Math. Appl. 29, 115\u2013132 (1995)","journal-title":"Comput. Math. Appl."},{"key":"38_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-63104-6_28","volume-title":"Automated Deduction\u2014CADE-14","author":"H Zhang","year":"1997","unstructured":"Zhang, H.: SATO: an efficient prepositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 272\u2013275. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63104-6_28"},{"key":"38_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.entcs.2004.07.023","volume":"125","author":"J Zhang","year":"2005","unstructured":"Zhang, J., Huang, Z.: Reducing symmetries to generate easier SAT instances. Electron. Notes Theor. Comput. Sci. 125, 149\u2013164 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"38_CR30","unstructured":"Zhang, J., Zhang, H.: SEM: a system for enumerating models. In: IJCAI (1995)"},{"key":"38_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45683-X_14","volume-title":"PRICAI 2002: Trends in Artificial Intelligence","author":"W Zhang","year":"2002","unstructured":"Zhang, W., Huang, Z., Zhang, J.: Parallel execution of stochastic search procedures on reduced SAT instances. In: Ishizuka, M., Sattar, A. (eds.) PRICAI 2002. LNCS (LNAI), vol. 2417, pp. 108\u2013117. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45683-X_14"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2023: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7022-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T16:06:53Z","timestamp":1703520413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7022-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,10]]},"ISBN":["9789819970216","9789819970223"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7022-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,10]]},"assertion":[{"value":"10 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jakarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"422","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}