Computer-Assisted Intuition: SAT Solvers in Mathematical Discovery

Learn how SAT solvers and automated reasoning tools can enhance mathematical intuition and discovery in this lecture by Bernardo Subercaseaux from CMU. Explore how computational search techniques can generate insightful constructions in discrete mathematics, leading to new conjectures and concrete results. Discover through various case studies how these tools can challenge intuition, reveal unexpected patterns, and guide mathematical discovery. This talk is part of the Simons Institute for the Theory of Computing and SLMath Joint Workshop on AI for Mathematics and Theoretical Computer Science, demonstrating the powerful intersection of computational methods and mathematical research.