Curtis Bright
University of Windsor
SAT Solvers, Isomorph-free Generation, and the Quest for the Minimum Kochen–Specker System
February 7, 2023
ESB 4127
I will describe a new approach for exhaustively generating combinatorial objects by combining a satisfiability (SAT) solver with an isomorph-free exhaustive generation method such as orderly generation. The SAT solver is able to limit the search to objects that satisfy given ...
Read more