{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T08:04:21Z","timestamp":1764403461132,"version":"3.46.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031906527"},{"type":"electronic","value":"9783031906534"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":120,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We tackle the problem of enumerating set-theoretic solutions to the Yang-Baxter equation. This equation originates from statistical and quantum mechanics, but also has applications in knot theory, cryptography, quantum computation and group theory. Non-degenerate, involutive solutions have been enumerated for sets up to size 10 using constraint programming with partial static symmetry breaking\u00a0[1]; for general non-involutive solutions, a similar approach was used to enumerate solutions for sets up to size 8. In this paper, we use and extend the SAT Modulo Symmetries framework (SMS), to expand the boundaries for which solutions are known. The SMS framework relies on a\n                    <jats:italic>minimality check<\/jats:italic>\n                    ; we present two solutions to this, one that stays close to the original one designed for enumerating graphs and a new incremental, SAT-based approach. With our new method, we can reproduce previously known results much faster and also report on results for sizes that have remained out of reach so far.\n                  <\/jats:p>","DOI":"10.1007\/978-3-031-90653-4_1","type":"book-chapter","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T08:22:01Z","timestamp":1746174121000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7975-4838","authenticated-orcid":false,"given":"Daimy","family":"Van Caudenberg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3460-4251","authenticated-orcid":false,"given":"Bart","family":"Bogaerts","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0954-7785","authenticated-orcid":false,"given":"Leandro","family":"Vendramin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Akg\u00fcn, \u00d6., Mereb, M., Vendramin, L.: Enumeration of set-theoretic solutions to the Yang-Baxter equation. Math. Comput. 91(335), 1469\u20131481 (2022). https:\/\/doi.org\/10.1090\/MCOM\/3696","DOI":"10.1090\/MCOM\/3696"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient symmetry breaking for Boolean satisfiability. IEEE Trans. Computers 55(5), 549\u2013558 (2006). https:\/\/doi.org\/10.1109\/TC.2006.75","DOI":"10.1109\/TC.2006.75"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Anders, M., Brenner, S., Rattan, G.: Satsuma: Structure-based symmetry breaking in SAT. In: Chakraborty, S., Jiang, J.R. (eds.) 27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, August 21-24, 2024, Pune, India. LIPIcs, vol.\u00a0305, pp. 4:1\u20134:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.SAT.2024.4","DOI":"10.4230\/LIPICS.SAT.2024.4"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Benhamou, B., Nabhani, T., Ostrowski, R., Sa\u00efdi, M.R.: Enhancing clause learning by symmetry in SAT solvers. In: 22nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010, Arras, France, 27-29 October 2010 - Volume 1. pp. 329\u2013335. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/ICTAI.2010.55","DOI":"10.1109\/ICTAI.2010.55"},{"key":"1_CR5","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2020 \u2013 Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bogaerts, B., Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: Certified dominance and symmetry breaking for combinatorial optimisation. J. Artif. Intell. Res. 77, 1539\u20131589 (2023). https:\/\/doi.org\/10.1613\/jair.1.14296","DOI":"10.1613\/jair.1.14296"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Ced\u00f3, F., Jespers, E., Okni\u0144ski, J.: Braces and the Yang-Baxter equation. Communications in Mathematical Physics 327(1), 101\u2013116 (2014). https:\/\/doi.org\/10.1007\/s00220-014-1935-y","DOI":"10.1007\/s00220-014-1935-y"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Childs, L.N., Greither, C., Keating, K.P., Koch, A., Kohl, T., Truman, P.J., Underwood, R.G.: Hopf algebras and Galois module theory, Mathematical Surveys and Monographs, vol.\u00a0260. Providence, RI: American Mathematical Society (AMS) (2021). https:\/\/doi.org\/10.1090\/surv\/260","DOI":"10.1090\/surv\/260"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Colazzo, I., Jespers, E., Kubat, \u0141., Van\u00a0Antwerpen, A.: Structure algebras of finite set-theoretic solutions of the Yang\u2013Baxter equation (2023), https:\/\/arxiv.org\/abs\/2305.06023","DOI":"10.1093\/imrn\/rnad183"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Devriendt, J., Bogaerts, B., Bruynooghe, M.: Symmetric explanation learning: Effective dynamic symmetry handling for SAT. In: Gaspers, S., Walsh, T. (eds.) Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10491, pp. 83\u2013100. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_6","DOI":"10.1007\/978-3-319-66263-3_6"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Devriendt, J., Bogaerts, B., Bruynooghe, M., Denecker, M.: Improved static symmetry breaking for SAT. In: Creignou, N., Le Berre, D. (eds.) Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings. Lecture Notes in Computer Science, vol.\u00a09710, pp. 104\u2013122. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_8","DOI":"10.1007\/978-3-319-40970-2_8"},{"key":"1_CR12","unstructured":"Drinfel\u2019d, V.G.: Quantum groups. In: Proceedings of to the International Mathematical Congress in Berkeley (1986). vol.\u00a01, pp. 798\u2013820. Providence, RI: American Mathematical Society (AMS) (1987)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Drinfeld, V.G.: On some unsolved problems in quantum group theory. In: Kulish, P.P. (ed.) Quantum Groups. pp.\u00a01\u20138. Lecture Notes in Mathematics, Springer Berlin Heidelberg, Berlin, Heidelberg (1992)","DOI":"10.1007\/BFb0101175"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Etingof, P., Schedler, T., Soloviev, A.: Set-theoretical solutions to the quantum Yang-Baxter equation. Duke Mathematical Journal 100(2), 169\u2013209 (1999). https:\/\/doi.org\/10.1215\/S0012-7094-99-10007-X","DOI":"10.1215\/S0012-7094-99-10007-X"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Fazekas, K., Niemetz, A., Preiner, M., Kirchweger, M., Szeider, S., Biere, A.: IPASIR-UP: user propagators for CDCL. In: Mahajan, M., Slivovsky, F. (eds.) 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. LIPIcs, vol.\u00a0271, pp. 8:1\u20138:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.SAT.2023.8","DOI":"10.4230\/LIPICS.SAT.2023.8"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Gateva-Ivanova, T., Van\u00a0den Bergh, M.: Semigroups of $$I$$-type. Journal of Algebra 206(1), 97\u2013112 (1998). https:\/\/doi.org\/10.1006\/jabr.1997.7399","DOI":"10.1006\/jabr.1997.7399"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Gent, I.P., Petrie, K.E., Puget, J.: Symmetry in constraint programming. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol.\u00a02, pp. 329\u2013376. Elsevier (2006). https:\/\/doi.org\/10.1016\/S1574-6526(06)80014-3","DOI":"10.1016\/S1574-6526(06)80014-3"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Guarnieri, L., Vendramin, L.: Skew braces and the Yang-Baxter equation. Mathematics of Computation 86(307), 2519\u20132534 (2017). https:\/\/doi.org\/10.1090\/mcom\/3161","DOI":"10.1090\/mcom\/3161"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Kirchweger, M., Peitl, T., Szeider, S.: Co-certificate learning with SAT modulo symmetries. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China. pp. 1944\u20131953. ijcai.org (2023). https:\/\/doi.org\/10.24963\/IJCAI.2023\/216","DOI":"10.24963\/IJCAI.2023\/216"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Kirchweger, M., Scheucher, M., Szeider, S.: A SAT attack on rota\u2019s basis conjecture. In: Meel, K.S., Strichman, O. (eds.) 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel. LIPIcs, vol.\u00a0236, pp. 4:1\u20134:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.SAT.2022.4","DOI":"10.4230\/LIPICS.SAT.2022.4"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Kirchweger, M., Szeider, S.: SAT modulo symmetries for graph generation. In: Michel, L.D. (ed.) 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021. LIPIcs, vol.\u00a0210, pp. 34:1\u201334:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.CP.2021.34","DOI":"10.4230\/LIPICS.CP.2021.34"},{"key":"1_CR22","unstructured":"Klieber, W., Kwon, G.: Efficient CNF encoding for selecting $$1$$ from $$N$$ objects. In: Fourth Workshop on Constraints in Formal Verification (CFV\u201907) (2007), https:\/\/api.semanticscholar.org\/CorpusID:165159977"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Lu, J.H., Yan, M., Zhu, Y.C.: On the set-theoretical Yang-Baxter equation. Duke Mathematical Journal 104(1), 1\u201318 (2000). https:\/\/doi.org\/10.1215\/S0012-7094-00-10411-5","DOI":"10.1215\/S0012-7094-00-10411-5"},{"key":"1_CR24","unstructured":"Nelson, S.: The combinatorial revolution in knot theory. Notices of the American Mathematical Society 58(11), 1553\u20131561 (2011)"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Rump, W.: A decomposition theorem for square-free unitary solutions of the quantum Yang-Baxter equation. Advances in Mathematics 193(1), 40\u201355 (2005). https:\/\/doi.org\/10.1016\/j.aim.2004.03.019","DOI":"10.1016\/j.aim.2004.03.019"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Rump, W.: Braces, radical rings, and the quatum Yang-Baxter equation. Journal of Algebra 307(1), 153\u2013170 (2007). https:\/\/doi.org\/10.1016\/j.jalgebra.2006.03.040","DOI":"10.1016\/j.jalgebra.2006.03.040"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Rump, W.: $$L$$-algebras, self-similarity, and $$l$$-groups. Journal of Algebra 320(6), 2328\u20132348 (2008). https:\/\/doi.org\/10.1016\/j.jalgebra.2008.05.033","DOI":"10.1016\/j.jalgebra.2008.05.033"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Sabharwal, A.: Symchaff: exploiting symmetry in a structure-aware satisfiability solver. Constraints An Int. J. 14(4), 478\u2013505 (2009). https:\/\/doi.org\/10.1007\/s10601-008-9060-1","DOI":"10.1007\/s10601-008-9060-1"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Seress, A.: Permutation group algorithms. Cambridge tracts in mathematics, Cambridge University Press, New York (2003). https:\/\/doi.org\/10.1017\/CBO9780511546549","DOI":"10.1017\/CBO9780511546549"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Soloviev, A.: Non-unitary set-theoretical solutions to the quantum Yang-Baxter equation. Mathematical Research Letters 7(5-6), 577\u2013596 (2000). https:\/\/doi.org\/10.4310\/MRL.2000.v7.n5.a4","DOI":"10.4310\/MRL.2000.v7.n5.a4"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Van\u00a0Caudenberg, D., Bogaerts, B., Vendramin, V.: Incremental SAT-based enumeration of solutions to the Yang-Baxter equation (2025), https:\/\/arxiv.org\/abs\/2501.14363","DOI":"10.1007\/978-3-031-90653-4_1"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Vendramin, L.: Skew braces: a brief survey. In: Geometric methods in physics XL, workshop, Bia\u0142owie\u017ca, Poland, June 20\u201325, 2023, pp. 153\u2013175. Cham: Birkh\u00e4user (2024). https:\/\/doi.org\/10.1007\/978-3-031-62407-0_12","DOI":"10.1007\/978-3-031-62407-0_12"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90653-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:37:14Z","timestamp":1764401834000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90653-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031906527","9783031906534"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90653-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamilton, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2025\/conferences\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}