{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:08Z","timestamp":1750221008871,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326232","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"203-210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing"],"prefix":"10.1145","author":[{"given":"Pei","family":"Huang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Computer Science & University of Chinese Academy of Sciences, Beijing, China"}]},{"given":"Minghao","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Computer Science & University of Chinese Academy of Sciences, Beijing, China"}]},{"given":"Cunjing","family":"Ge","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Computer Science & University of Chinese Academy of Sciences, Beijing, China"}]},{"given":"Feifei","family":"Ma","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Computer Science, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Computer Science & University of Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2898607.2898612"},{"key":"e_1_3_2_1_2_1","volume-title":"CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings. 117--133","author":"Bright Curtis","year":"2016","unstructured":"Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, and Krzysztof Czarnecki. 2016. MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures. In Computer Algebra in Scientific Computing - 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings. 117--133."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12203"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3209006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2004.06.007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786445008646550"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20099"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1202540"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(96)00057-2"},{"volume-title":"North-Holland mathematics studies.","author":"Dinitz JH","key":"e_1_3_2_1_10_1","unstructured":"JH Dinitz and WDWallia. 1985. Four orthogonal one-factorizations on ten points. In North-Holland mathematics studies. Vol. 114. Elsevier, 143--149."},{"key":"e_1_3_2_1_11_1","volume-title":"Room squares and related designs. Contemporary Design Theory: A collection of surveys","author":"Dinitz Jeffrey H","year":"1992","unstructured":"Jeffrey H Dinitz and Douglas R Stinson. 1992. Room squares and related designs. Contemporary Design Theory: A collection of surveys (1992), 137--204."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283396.2283482"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1624025.1624033"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_24"},{"key":"e_1_3_2_1_15_1","volume-title":"Bordeaux, France","author":"Heule Marijn J. H.","year":"2016","unstructured":"Marijn J. H. Heule, Oliver Kullmann, and Victor W. Marek. 2016. Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. In Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings. 228--245."},{"key":"e_1_3_2_1_16_1","volume-title":"IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings. 354--369","author":"Huang Pei","year":"2018","unstructured":"Pei Huang, Feifei Ma, Cunjing Ge, Jian Zhang, and Hantao Zhang. 2018. Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing. In Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings. 354--369."},{"volume-title":"The Art of Computer Programming","author":"Knuth Donald E","key":"e_1_3_2_1_17_1","unstructured":"Donald E Knuth. 2011. The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 2. Pearson Education India."},{"key":"e_1_3_2_1_18_1","first-page":"47","article-title":"An application of quasigroups in cryptology","volume":"8","author":"Krapez Aleksandar","year":"2010","unstructured":"Aleksandar Krapez. 2010. An application of quasigroups in cryptology. Math. Maced 8 (2010), 47--52.","journal-title":"Math. Maced"},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"Finding orthogonal latin squares using finite model searching tools","volume":"56","author":"Ma FeiFei","year":"2013","unstructured":"FeiFei Ma and Jian Zhang. 2013. Finding orthogonal latin squares using finite model searching tools. Science China Information Sciences 56, 3 (2013), 1--9.","journal-title":"Science China Information Sciences"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/015\/0180910"},{"key":"e_1_3_2_1_21_1","volume-title":"Analysis of Room's square design. The Annals of Mathematical Statistics","author":"Shah KR","year":"1970","unstructured":"KR Shah. 1970. Analysis of Room's square design. The Annals of Mathematical Statistics (1970), 743--745."},{"key":"e_1_3_2_1_22_1","volume-title":"Quasigroups in cryptology. arXiv preprint arXiv:1007.3572","author":"Shcherbacov Victor A","year":"2010","unstructured":"Victor A Shcherbacov. 2010. Quasigroups in cryptology. arXiv preprint arXiv:1007.3572 (2010)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(94)00219-B"},{"key":"e_1_3_2_1_24_1","first-page":"197","article-title":"On the use of pairwise balanced designs and closure spaces in the construction of structures of degree at least 3","volume":"45","author":"Teirlinck Luc","year":"1990","unstructured":"Luc Teirlinck. 1990. On the use of pairwise balanced designs and closure spaces in the construction of structures of degree at least 3. Le Matematiche 45, 1 (1990), 197--218.","journal-title":"Le Matematiche"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80031-3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90102-2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20154"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/648233.753307"},{"key":"e_1_3_2_1_29_1","unstructured":"Hantao Zhang. 2009. Combinatorial Designs by SAT Solvers. In Handbook of Satisfiability. 533--568."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006351428454"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1625855.1625894"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304415.3304613"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9396-y"}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326232","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:59Z","timestamp":1750206359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":33,"alternative-id":["10.1145\/3326229.3326232","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326232","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}