<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bright, Curtis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A new lower bound in the &lt;em&gt;abc&lt;/em&gt; conjecture</style></title><secondary-title><style face="normal" font="default" size="100%">Canadian Mathematical Bulletin</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.4153/S0008439523000784</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><publisher><style face="normal" font="default" size="100%">Canadian Mathematical Society</style></publisher><volume><style face="normal" font="default" size="100%">67</style></volume><pages><style face="normal" font="default" size="100%">369–378</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yameen Ajani</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Jonathan D. Hauenstein</style></author><author><style face="normal" font="default" size="100%">Wen-shin Lee</style></author><author><style face="normal" font="default" size="100%">Shaoshi Chen</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">SAT and Lattice Reduction for Integer Factorization</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, ISSAC 2024, Raleigh, NC, USA, July 16-19, 2024</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3666000.3669712</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">391–399</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Conor Duggan</style></author><author><style face="normal" font="default" size="100%">Zhengyu Li</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Michael J. Wooldridge</style></author><author><style face="normal" font="default" size="100%">Jennifer G. Dy</style></author><author><style face="normal" font="default" size="100%">Sriraam Natarajan</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A SAT + Computer Algebra System Verification of the Ramsey Problem &lt;em&gt;R&lt;/em&gt;(3, 8) (Student Abstract)</style></title><secondary-title><style face="normal" font="default" size="100%">Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1609/aaai.v38i21.30437</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">AAAI Press</style></publisher><pages><style face="normal" font="default" size="100%">23480–23481</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zhengyu Li</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Michael J. Wooldridge</style></author><author><style face="normal" font="default" size="100%">Jennifer G. Dy</style></author><author><style face="normal" font="default" size="100%">Sriraam Natarajan</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract)</style></title><secondary-title><style face="normal" font="default" size="100%">Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1609/aaai.v38i21.30472</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">AAAI Press</style></publisher><pages><style face="normal" font="default" size="100%">23559–23560</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zhengyu Li</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A SAT Solver + Computer Algebra Attack on the Minimum Kochen-Specker Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024, Jeju, South Korea, August 3-9, 2024</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.ijcai.org/proceedings/2024/210</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ijcai.org</style></publisher><pages><style face="normal" font="default" size="100%">1898–1906</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Nahiyan Alamgir</style></author><author><style face="normal" font="default" size="100%">Saeed Nejati</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Christopher W. Brown</style></author><author><style face="normal" font="default" size="100%">Daniela Kaufmann</style></author><author><style face="normal" font="default" size="100%">Cláudia Nalon</style></author><author><style face="normal" font="default" size="100%">Alexander Steen</style></author><author><style face="normal" font="default" size="100%">Martin Suda</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">SHA-256 Collision Attack with Programmatic SAT</style></title><secondary-title><style face="normal" font="default" size="100%">Joint Proceedings of the 9th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 9th Satisfiability Checking and Symbolic Computation Workshop (SC-Square), 2024 co-located with the 12th International Joint Conference on Automated Reasoning</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ceur-ws.org/Vol-3717/paper5.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">3717</style></volume><pages><style face="normal" font="default" size="100%">91–110</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aaron Barnoff</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Jeffrey O. Shallit</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Szilárd Zsolt Fazekas</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Using Finite Automata to Compute the Base-&lt;em&gt;b&lt;/em&gt; Representation of the Golden Ratio and Other Quadratic Irrationals</style></title><secondary-title><style face="normal" font="default" size="100%">Implementation and Application of Automata - 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-031-71112-1_3</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">15015</style></volume><pages><style face="normal" font="default" size="100%">35–50</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yameen Ajani</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Erika Ábrahám</style></author><author><style face="normal" font="default" size="100%">Thomas Sturm</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Hybrid SAT and Lattice Reduction Approach for Integer Factorization</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 8th SC-Square Workshop co-located with the 48th International Symposium on Symbolic and Algebraic Computation, SC-Square@ISSAC 2023, Tromsø, Norway, July 28, 2023</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2023</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ceur-ws.org/Vol-3455/short1.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">3455</style></volume><pages><style face="normal" font="default" size="100%">39–43</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniel Dallaire</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ali Kemal Uncu</style></author><author><style face="normal" font="default" size="100%">Haniel Barbosa</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Enumerating Projective Planes of Order Nine with Proof Verification</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 7th SC-Square Workshop co-located with the Federated Logic Conference, SC-Square@FLoC 2022, as a part of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, Haifa, Israel, August 12, 2022</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ceur-ws.org/Vol-3458/paper5.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">3458</style></volume><pages><style face="normal" font="default" size="100%">45–54</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Noah Rubin</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Brett Stevens</style></author><author><style face="normal" font="default" size="100%">Kevin K. H. Cheung</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract)</style></title><secondary-title><style face="normal" font="default" size="100%">Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Eve</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1609/aaai.v36i11.21655</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">AAAI Press</style></publisher><pages><style face="normal" font="default" size="100%">13037–13038</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">James H. Davenport</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Proceedings of the 6th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, SC-Square@SIAM AG 2021, Virtual Event, College Station, USA, August 19-20, 2021</style></title><secondary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-3273</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">3273</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zhengyu Li</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ali Kemal Uncu</style></author><author><style face="normal" font="default" size="100%">Haniel Barbosa</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An SC-Square Approach to the Minimum Kochen-Specker Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 7th SC-Square Workshop co-located with the Federated Logic Conference, SC-Square@FLoC 2022, as a part of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, Haifa, Israel, August 12, 2022</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ceur-ws.org/Vol-3458/paper6.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">3458</style></volume><pages><style face="normal" font="default" size="100%">55–66</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">When satisfiability solving meets symbolic computation</style></title><secondary-title><style face="normal" font="default" size="100%">Commun. ACM</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3500921</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">7</style></number><volume><style face="normal" font="default" size="100%">65</style></volume><pages><style face="normal" font="default" size="100%">64–72</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Albert Heinle</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symb. Comput.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.jsc.2019.10.013</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">102</style></volume><pages><style face="normal" font="default" size="100%">153–172</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Noah Rubin</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Kevin K. H. Cheung</style></author><author><style face="normal" font="default" size="100%">Brett Stevens</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Improving Integer and Constraint Programming for Graeco-Latin Squares</style></title><secondary-title><style face="normal" font="default" size="100%">33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021, Washington, DC, USA, November 1-3, 2021</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1109/ICTAI52525.2021.00096</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pages><style face="normal" font="default" size="100%">604–608</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Kevin K. H. Cheung</style></author><author><style face="normal" font="default" size="100%">Brett Stevens</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A SAT-based Resolution of Lam's Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Eve</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1609/aaai.v35i5.16483</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">AAAI Press</style></publisher><pages><style face="normal" font="default" size="100%">3669–3676</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Applying computer algebra systems with SAT solvers to the Williamson conjecture</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symb. Comput.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.jsc.2019.07.024</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">100</style></volume><pages><style face="normal" font="default" size="100%">187–209</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Trans. Inf. Theory</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1109/TIT.2020.3016510</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">12</style></number><volume><style face="normal" font="default" size="100%">66</style></volume><pages><style face="normal" font="default" size="100%">7739–7751</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Kevin K. H. Cheung</style></author><author><style face="normal" font="default" size="100%">Brett Stevens</style></author><author><style face="normal" font="default" size="100%">Dominique Roy</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A nonexistence certificate for projective planes of order ten with weight 15 codewords</style></title><secondary-title><style face="normal" font="default" size="100%">Appl. Algebra Eng. Commun. Comput.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/s00200-020-00426-y</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3-4</style></number><volume><style face="normal" font="default" size="100%">31</style></volume><pages><style face="normal" font="default" size="100%">195–213</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Kevin K. H. Cheung</style></author><author><style face="normal" font="default" size="100%">Brett Stevens</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Leszek Gasieniec</style></author><author><style face="normal" font="default" size="100%">Ralf Klasing</style></author><author><style face="normal" font="default" size="100%">Tomasz Radzik</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Nonexistence Certificates for Ovals in a Projective Plane of Order Ten</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-48966-3_8</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">12126</style></volume><pages><style face="normal" font="default" size="100%">97–111</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Kevin K. H. Cheung</style></author><author><style face="normal" font="default" size="100%">Brett Stevens</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Christian Bessiere</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.24963/ijcai.2020/203</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ijcai.org</style></publisher><pages><style face="normal" font="default" size="100%">1460–1466</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Jürgen Gerhard</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Jürgen Gerhard</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Effective Problem Solving Using SAT Solvers</style></title><secondary-title><style face="normal" font="default" size="100%">Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-41258-6_15</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">1125</style></volume><pages><style face="normal" font="default" size="100%">205–219</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tima Pakfetrat</style></author><author><style face="normal" font="default" size="100%">Guy-Vincent Jourdan</style></author><author><style face="normal" font="default" size="100%">Kostas Kontogiannis</style></author><author><style face="normal" font="default" size="100%">Robert F. Enenkel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">SAT solvers and computer algebra systems: a powerful combination for mathematics</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 29th Annual International Conference on Computer Science and Software Engineering, CASCON 2019, Markham, Ontario, Canada, November 4-6, 2019</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://dl.acm.org/doi/10.5555/3370272.3370309</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">323–328</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Dragomir Ž. Ðoković</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples</style></title><secondary-title><style face="normal" font="default" size="100%">The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Hono</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1609/aaai.v33i01.33011435</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">AAAI Press</style></publisher><pages><style face="normal" font="default" size="100%">1435–1442</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Dragomir Z. Dokovic</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The SAT+CAS method for combinatorial search with applications to best matrices</style></title><secondary-title><style face="normal" font="default" size="100%">Ann. Math. Artif. Intell.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/s10472-019-09681-3</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">87</style></volume><pages><style face="normal" font="default" size="100%">321–342</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Albert Heinle</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Manuel Kauers</style></author><author><style face="normal" font="default" size="100%">Alexey Ovchinnikov</style></author><author><style face="normal" font="default" size="100%">Éric Schost</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Enumeration of Complex Golay Pairs via Programmatic SAT</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3208976.3209006</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">111–118</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Sheila A. McIlraith</style></author><author><style face="normal" font="default" size="100%">Kilian Q. Weinberger</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A SAT+CAS Method for Enumerating Williamson Matrices of Even Order</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orl</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1609/aaai.v32i1.12203</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">AAAI Press</style></publisher><pages><style face="normal" font="default" size="100%">6573–6580</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The SAT+CAS paradigm and the Williamson conjecture</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Commun. Comput. Algebra</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3313880.3313889</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">52</style></volume><pages><style face="normal" font="default" size="100%">82–84</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Edward Zulkoski</style></author><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Albert Heinle</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Krzysztof Czarnecki</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures</style></title><secondary-title><style face="normal" font="default" size="100%">J. Autom. Reason.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/s10817-016-9396-y</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">58</style></volume><pages><style face="normal" font="default" size="100%">313–339</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>32</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computational Methods for Combinatorial and Number Theoretic Problems</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://hdl.handle.net/10012/11761</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">University of Waterloo, Ontario, Canada</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">phd</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author><author><style face="normal" font="default" size="100%">Albert Heinle</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Saeed Nejati</style></author><author><style face="normal" font="default" size="100%">Krzysztof Czarnecki</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Vladimir P. Gerdt</style></author><author><style face="normal" font="default" size="100%">Wolfram Koepf</style></author><author><style face="normal" font="default" size="100%">Werner M. Seiler</style></author><author><style face="normal" font="default" size="100%">Evgenii V. Vorozhtsov</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures</style></title><secondary-title><style face="normal" font="default" size="100%">Computer Algebra in Scientific Computing - 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-45641-6_9</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">9890</style></volume><pages><style face="normal" font="default" size="100%">117–133</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author><author><style face="normal" font="default" size="100%">Albert Heinle</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Saeed Nejati</style></author><author><style face="normal" font="default" size="100%">Krzysztof Czarnecki</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Erika Ábrahám</style></author><author><style face="normal" font="default" size="100%">James H. Davenport</style></author><author><style face="normal" font="default" size="100%">Pascal Fontaine</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), Timisoara, Romania, September 24, 2016</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ceur-ws.org/Vol-1804/paper-04.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">1804</style></volume><pages><style face="normal" font="default" size="100%">13–19</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Raymond R. Devillers</style></author><author><style face="normal" font="default" size="100%">Jeffrey O. Shallit</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Minimal Elements for the Prime Numbers</style></title><secondary-title><style face="normal" font="default" size="100%">Exp. Math.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1080/10586458.2015.1064048</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">25</style></volume><pages><style face="normal" font="default" size="100%">321–331</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Arne Storjohann</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Éric Schost</style></author><author><style face="normal" font="default" size="100%">Ioannis Z. Emiris</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Vector rational number reconstruction</style></title><secondary-title><style face="normal" font="default" size="100%">Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/1993886.1993900</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">51–58</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>